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/HiddenEqualityWithBranches.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:48:46,932 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:48:46,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:48:46,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:48:46,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:48:46,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:48:46,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:48:46,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:48:46,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:48:46,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:48:46,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:48:46,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:48:46,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:48:46,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:48:46,965 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:48:46,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:48:46,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:48:46,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:48:46,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:48:46,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:48:46,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:48:46,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:48:46,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:48:46,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:48:46,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:48:46,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:48:46,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:48:46,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:48:46,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:48:46,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:48:46,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:48:46,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:48:46,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:48:46,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:48:46,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:48:46,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:48:46,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:48:47,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:48:47,012 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:48:47,013 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:48:47,013 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:48:47,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:48:47,014 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:48:47,014 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:48:47,014 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:48:47,015 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:48:47,015 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:48:47,015 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:48:47,015 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:48:47,015 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:48:47,016 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:48:47,016 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:48:47,017 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:48:47,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:48:47,017 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:48:47,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:48:47,017 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:48:47,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:48:47,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:48:47,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:48:47,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:48:47,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:48:47,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:48:47,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:48:47,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:48:47,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:48:47,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:48:47,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:48:47,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:48:47,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:48:47,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:48:47,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:48:47,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:48:47,021 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:48:47,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:48:47,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:48:47,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:48:47,022 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:48:47,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:48:47,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:48:47,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:48:47,084 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:48:47,084 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:48:47,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl [2018-12-03 15:48:47,086 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl' [2018-12-03 15:48:47,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:48:47,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:48:47,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:48:47,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:48:47,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:48:47,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,176 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:48:47,176 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:48:47,176 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:48:47,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:48:47,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:48:47,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:48:47,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:48:47,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... [2018-12-03 15:48:47,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:48:47,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:48:47,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:48:47,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:48:47,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:48:47,291 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:48:47,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:48:47,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:48:47,467 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:48:47,468 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:48:47,468 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:48:47 BoogieIcfgContainer [2018-12-03 15:48:47,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:48:47,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:48:47,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:48:47,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:48:47,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:48:47" (1/2) ... [2018-12-03 15:48:47,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242fdc10 and model type HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:48:47, skipping insertion in model container [2018-12-03 15:48:47,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:48:47" (2/2) ... [2018-12-03 15:48:47,477 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEqualityWithBranches.bpl [2018-12-03 15:48:47,487 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:48:47,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:48:47,514 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:48:47,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:48:47,550 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:48:47,550 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:48:47,550 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:48:47,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:48:47,551 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:48:47,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:48:47,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:48:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:48:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 15:48:47,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:47,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 15:48:47,581 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:47,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 978, now seen corresponding path program 1 times [2018-12-03 15:48:47,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:47,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:47,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:47,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:47,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:47,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:48:47,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:48:47,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:48:47,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:48:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:48:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:48:47,771 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:48:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:47,847 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-12-03 15:48:47,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:48:47,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 15:48:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:47,866 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:48:47,866 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:48:47,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:48:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:48:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:48:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:48:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-03 15:48:47,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 7 transitions. Word has length 2 [2018-12-03 15:48:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:47,943 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-03 15:48:47,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:48:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2018-12-03 15:48:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:48:47,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:47,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:48:47,944 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:47,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash 931598, now seen corresponding path program 1 times [2018-12-03 15:48:47,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:47,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:47,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:47,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:47,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:48:48,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:48:48,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:48:48,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:48:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:48:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:48:48,023 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 3 states. [2018-12-03 15:48:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:48,045 INFO L93 Difference]: Finished difference Result 9 states and 14 transitions. [2018-12-03 15:48:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:48:48,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 15:48:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:48,046 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:48:48,046 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:48:48,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:48:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:48:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:48:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:48:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-12-03 15:48:48,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 8 transitions. Word has length 4 [2018-12-03 15:48:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:48,051 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 8 transitions. [2018-12-03 15:48:48,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:48:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2018-12-03 15:48:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:48:48,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:48,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:48:48,052 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:48,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 931660, now seen corresponding path program 1 times [2018-12-03 15:48:48,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:48,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:48,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:48,103 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:48:48,105 INFO L205 CegarAbsIntRunner]: [0], [8], [14], [17] [2018-12-03 15:48:48,142 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:48:48,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:48:48,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:48:48,307 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:48:48,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:48,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:48:48,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:48,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:48,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2018-12-03 15:48:48,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:48,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:48:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:48:48,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:48:48,457 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 4 states. [2018-12-03 15:48:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:48,493 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2018-12-03 15:48:48,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:48:48,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:48:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:48,495 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:48:48,495 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:48:48,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:48:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:48:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:48:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:48:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-03 15:48:48,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-03 15:48:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:48,499 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-03 15:48:48,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:48:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-03 15:48:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:48:48,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:48,500 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:48:48,500 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:48,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash 895317000, now seen corresponding path program 1 times [2018-12-03 15:48:48,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:48,548 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 15:48:48,548 INFO L205 CegarAbsIntRunner]: [0], [8], [12], [14], [17] [2018-12-03 15:48:48,551 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:48:48,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:48:48,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:48:48,609 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 7 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:48:48,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:48,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:48:48,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:48,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:48,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:48,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:48:48,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:48,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:48:48,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:48:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:48:48,778 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-03 15:48:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:48,847 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2018-12-03 15:48:48,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:48:48,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:48:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:48,848 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:48:48,849 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:48:48,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:48:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:48:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:48:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:48:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-03 15:48:48,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-12-03 15:48:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:48,853 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-03 15:48:48,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:48:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-03 15:48:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:48:48,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:48,854 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1] [2018-12-03 15:48:48,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:48,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:48,855 INFO L82 PathProgramCache]: Analyzing trace with hash 895317062, now seen corresponding path program 2 times [2018-12-03 15:48:48,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:49,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:49,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:49,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:49,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:49,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:49,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:49,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:49,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:48:49,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:49,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 15:48:49,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:49,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:48:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:48:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:48:49,245 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-12-03 15:48:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:49,331 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-12-03 15:48:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:48:49,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 15:48:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:49,332 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:48:49,333 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:48:49,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:48:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:48:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:48:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:48:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 15:48:49,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2018-12-03 15:48:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:49,338 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 15:48:49,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:48:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 15:48:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:48:49,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:49,340 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:48:49,340 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:49,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1406229122, now seen corresponding path program 2 times [2018-12-03 15:48:49,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:49,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:49,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:49,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:49,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:49,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:49,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:49,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:49,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:49,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:49,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:49,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:48:49,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:49,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:49,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 15:48:49,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:49,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:48:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:48:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:48:49,749 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 9 states. [2018-12-03 15:48:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:49,954 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2018-12-03 15:48:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:48:49,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 15:48:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:49,955 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:48:49,955 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:48:49,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:48:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:48:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:48:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:48:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 15:48:49,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-12-03 15:48:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:49,960 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 15:48:49,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:48:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 15:48:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:48:49,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:49,962 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:48:49,962 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:49,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1528460676, now seen corresponding path program 3 times [2018-12-03 15:48:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:49,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:49,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:50,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:50,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:50,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:50,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:50,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:50,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:50,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:50,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:50,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:50,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:48:50,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:50,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:48:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:48:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:48:50,344 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2018-12-03 15:48:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:50,418 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-12-03 15:48:50,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:48:50,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 15:48:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:50,419 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:48:50,419 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:48:50,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:48:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:48:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:48:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:48:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:48:50,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-12-03 15:48:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:50,425 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:48:50,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:48:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:48:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:48:50,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:50,427 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1] [2018-12-03 15:48:50,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:50,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1528460614, now seen corresponding path program 3 times [2018-12-03 15:48:50,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:50,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:50,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:50,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:50,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:50,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:50,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:50,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:50,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:50,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:50,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:50,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:50,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:50,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 15:48:50,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:50,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:48:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:48:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:48:50,690 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-03 15:48:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:50,716 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-12-03 15:48:50,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:48:50,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-12-03 15:48:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:50,717 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:48:50,718 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:48:50,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:48:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:48:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:48:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:48:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 15:48:50,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-12-03 15:48:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 15:48:50,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:48:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 15:48:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:48:50,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:50,724 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 15:48:50,724 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:50,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 28156918, now seen corresponding path program 4 times [2018-12-03 15:48:50,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:50,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:50,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:50,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:50,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:50,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:50,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:50,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:50,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:50,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:50,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:50,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:50,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:50,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:48:50,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:50,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:48:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:48:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:48:50,971 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2018-12-03 15:48:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:51,004 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-03 15:48:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:48:51,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 15:48:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:51,006 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:48:51,006 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:48:51,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:48:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:48:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:48:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:48:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 15:48:51,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-12-03 15:48:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:51,011 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 15:48:51,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:48:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 15:48:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:48:51,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:51,012 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1] [2018-12-03 15:48:51,012 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:51,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 28156980, now seen corresponding path program 4 times [2018-12-03 15:48:51,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:51,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:51,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:51,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:51,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:51,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:51,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:51,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:51,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:51,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 15:48:51,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:51,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:48:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:48:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:48:51,491 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-12-03 15:48:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:51,516 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-12-03 15:48:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:48:51,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:48:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:51,519 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:48:51,519 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:48:51,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:48:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:48:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:48:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:48:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 15:48:51,524 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-12-03 15:48:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:51,525 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 15:48:51,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:48:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 15:48:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:48:51,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:51,526 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-12-03 15:48:51,526 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:51,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1289045744, now seen corresponding path program 5 times [2018-12-03 15:48:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:51,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:51,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:51,615 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:51,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:51,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:51,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:51,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:51,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:48:51,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:51,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:48:51,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:51,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:48:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:48:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:48:51,774 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2018-12-03 15:48:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:51,804 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-03 15:48:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:48:51,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 15:48:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:51,806 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:48:51,806 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:48:51,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:48:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:48:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:48:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:48:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 15:48:51,811 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-12-03 15:48:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:51,811 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 15:48:51,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:48:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 15:48:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:48:51,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:51,812 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1] [2018-12-03 15:48:51,812 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:51,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1289045806, now seen corresponding path program 5 times [2018-12-03 15:48:51,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:51,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:51,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:51,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:51,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:51,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:51,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:51,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:51,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:51,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:51,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:48:51,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:51,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:52,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 15:48:52,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:52,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:48:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:48:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:48:52,125 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 9 states. [2018-12-03 15:48:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:52,152 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-12-03 15:48:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:48:52,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-03 15:48:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:52,154 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:48:52,154 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:48:52,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:48:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:48:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:48:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:48:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-03 15:48:52,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-12-03 15:48:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:52,160 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-03 15:48:52,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:48:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-03 15:48:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:48:52,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:52,161 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-12-03 15:48:52,161 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:52,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:52,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1822430058, now seen corresponding path program 6 times [2018-12-03 15:48:52,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:52,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:52,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:52,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:52,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:52,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:52,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:52,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:52,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:52,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:52,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:52,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:48:52,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:52,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:48:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:48:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:48:52,663 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 9 states. [2018-12-03 15:48:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:52,706 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 15:48:52,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:48:52,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:48:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:52,707 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:48:52,707 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:48:52,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:48:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:48:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:48:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:48:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 15:48:52,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2018-12-03 15:48:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:52,710 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 15:48:52,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:48:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 15:48:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:48:52,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:52,711 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1] [2018-12-03 15:48:52,711 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:52,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1822430120, now seen corresponding path program 6 times [2018-12-03 15:48:52,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:52,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:52,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:52,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:52,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:52,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:52,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:52,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:52,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:52,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:52,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:53,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:53,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:48:53,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:53,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:48:53,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:48:53,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:48:53,046 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 10 states. [2018-12-03 15:48:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:53,076 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-12-03 15:48:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:48:53,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:48:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:53,078 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:48:53,079 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:48:53,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:48:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:48:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:48:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:48:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-03 15:48:53,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-12-03 15:48:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:53,083 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-03 15:48:53,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:48:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-03 15:48:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:48:53,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:53,084 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-12-03 15:48:53,084 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:53,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:53,085 INFO L82 PathProgramCache]: Analyzing trace with hash -991319708, now seen corresponding path program 7 times [2018-12-03 15:48:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:53,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:53,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:53,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:53,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:53,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:53,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:53,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:53,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:53,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:53,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:53,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:53,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:53,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:48:53,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:53,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:48:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:48:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:48:53,414 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2018-12-03 15:48:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:53,443 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-03 15:48:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:48:53,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 15:48:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:53,444 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:48:53,445 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:48:53,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:48:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:48:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:48:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:48:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 15:48:53,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-12-03 15:48:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:53,451 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 15:48:53,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:48:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 15:48:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:48:53,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:53,452 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1] [2018-12-03 15:48:53,452 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:53,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash -991319646, now seen corresponding path program 7 times [2018-12-03 15:48:53,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:53,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:53,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:53,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:53,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:53,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:53,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:53,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:53,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:53,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:53,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:53,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:53,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:53,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:53,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:54,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 15:48:54,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:54,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:48:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:48:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:48:54,049 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 11 states. [2018-12-03 15:48:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:54,281 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-12-03 15:48:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:48:54,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 15:48:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:54,282 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:48:54,282 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:48:54,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:48:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:48:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:48:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:48:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 15:48:54,289 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-12-03 15:48:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:54,289 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 15:48:54,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:48:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 15:48:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:48:54,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:54,290 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-12-03 15:48:54,291 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:54,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash 824551646, now seen corresponding path program 8 times [2018-12-03 15:48:54,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:54,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:54,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:54,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:54,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:54,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:54,491 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:54,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:54,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:54,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:54,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:54,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:54,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:48:54,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:54,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:54,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 15:48:54,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:54,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:48:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:48:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=645, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:48:54,897 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2018-12-03 15:48:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:55,268 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-12-03 15:48:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:48:55,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 15:48:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:55,269 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:48:55,269 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:48:55,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=843, Invalid=1509, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:48:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:48:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:48:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:48:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-03 15:48:55,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-12-03 15:48:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:55,275 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-03 15:48:55,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:48:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-03 15:48:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:48:55,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:55,276 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-12-03 15:48:55,277 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:55,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2120200664, now seen corresponding path program 9 times [2018-12-03 15:48:55,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:55,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:55,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:55,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:55,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:55,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:55,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:55,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:55,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:55,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:55,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:55,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:55,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:55,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:55,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:55,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:55,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:48:55,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:55,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:48:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:48:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:48:55,682 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 12 states. [2018-12-03 15:48:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:55,775 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 15:48:55,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:48:55,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 15:48:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:55,776 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:48:55,776 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:48:55,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:48:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:48:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:48:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:48:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 15:48:55,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2018-12-03 15:48:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:55,780 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 15:48:55,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:48:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 15:48:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:48:55,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:55,781 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1] [2018-12-03 15:48:55,782 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:55,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2120200726, now seen corresponding path program 8 times [2018-12-03 15:48:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:55,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:55,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:56,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:56,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:56,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:56,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:56,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:56,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:56,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:56,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:48:56,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:56,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:56,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:56,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:56,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:48:56,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:56,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:48:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:48:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:48:56,465 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 13 states. [2018-12-03 15:48:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:56,502 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-12-03 15:48:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:48:56,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-12-03 15:48:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:56,503 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:48:56,504 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:48:56,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:48:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:48:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:48:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:48:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-03 15:48:56,509 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-12-03 15:48:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:56,509 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-03 15:48:56,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:48:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-03 15:48:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:48:56,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:56,510 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-12-03 15:48:56,510 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:56,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1698391122, now seen corresponding path program 10 times [2018-12-03 15:48:56,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:56,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:56,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:56,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:56,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:56,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:56,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:56,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:56,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:56,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:56,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:56,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:56,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:56,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:57,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:57,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:48:57,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:57,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:48:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:48:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:48:57,430 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2018-12-03 15:48:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:57,457 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-12-03 15:48:57,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:48:57,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:48:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:57,459 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:48:57,459 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:48:57,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:48:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:48:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:48:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:48:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 15:48:57,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2018-12-03 15:48:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:57,465 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 15:48:57,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:48:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 15:48:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:48:57,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:57,466 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1] [2018-12-03 15:48:57,466 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:57,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1698391184, now seen corresponding path program 9 times [2018-12-03 15:48:57,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:57,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:57,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:57,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:57,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:57,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:57,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:57,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:57,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:57,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:57,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:57,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:57,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:57,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:58,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:58,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 15:48:58,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:58,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:48:58,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:48:58,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:48:58,184 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 14 states. [2018-12-03 15:48:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:58,219 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-12-03 15:48:58,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:48:58,220 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 15:48:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:58,221 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:48:58,221 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:48:58,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:48:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:48:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:48:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:48:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-03 15:48:58,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-12-03 15:48:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:58,227 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-03 15:48:58,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:48:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-03 15:48:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:48:58,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:58,228 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-12-03 15:48:58,228 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:58,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash 66347084, now seen corresponding path program 11 times [2018-12-03 15:48:58,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:58,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:58,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:58,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:58,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:58,414 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:58,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:58,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:58,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:58,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:58,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:58,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:48:58,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:58,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:58,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:58,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:58,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:48:58,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:58,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:48:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:48:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:48:58,649 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 14 states. [2018-12-03 15:48:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:58,681 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-12-03 15:48:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:48:58,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 15:48:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:58,683 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:48:58,683 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:48:58,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:48:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:48:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:48:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:48:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 15:48:58,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-12-03 15:48:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:58,687 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 15:48:58,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:48:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 15:48:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:48:58,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:58,688 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1] [2018-12-03 15:48:58,689 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:58,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:58,689 INFO L82 PathProgramCache]: Analyzing trace with hash 66347146, now seen corresponding path program 10 times [2018-12-03 15:48:58,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:58,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:58,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:58,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:58,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:58,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:58,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:58,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:58,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:58,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:58,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:58,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:59,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:59,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:59,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:59,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 15:48:59,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:59,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:48:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:48:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:48:59,283 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 15 states. [2018-12-03 15:48:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:59,326 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-12-03 15:48:59,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:48:59,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-12-03 15:48:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:59,328 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:48:59,328 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:48:59,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:48:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:48:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:48:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:48:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-03 15:48:59,332 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-12-03 15:48:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:59,332 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-03 15:48:59,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:48:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-03 15:48:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:48:59,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:59,333 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-12-03 15:48:59,334 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:59,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash -664910394, now seen corresponding path program 12 times [2018-12-03 15:48:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:59,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:59,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:59,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:59,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:59,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:59,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:59,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:59,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:59,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:59,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:59,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:59,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:59,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:59,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:00,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:00,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:49:00,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:49:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:49:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:49:00,247 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-12-03 15:49:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:00,281 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-03 15:49:00,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:49:00,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 15:49:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:00,282 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:49:00,282 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:49:00,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:49:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:49:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:49:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:49:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 15:49:00,287 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2018-12-03 15:49:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:00,287 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 15:49:00,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:49:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 15:49:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:49:00,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:00,288 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1] [2018-12-03 15:49:00,289 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:00,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash -664910332, now seen corresponding path program 11 times [2018-12-03 15:49:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:00,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:00,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:00,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:00,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:00,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:00,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:00,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:00,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:00,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:00,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:00,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:49:00,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:00,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:00,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:01,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:01,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 15:49:01,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:01,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:49:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:49:01,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:49:01,541 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 16 states. [2018-12-03 15:49:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:01,562 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-03 15:49:01,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:49:01,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-12-03 15:49:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:01,563 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:49:01,563 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:49:01,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:49:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:49:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:49:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:49:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-03 15:49:01,568 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-12-03 15:49:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:01,568 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-03 15:49:01,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:49:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-03 15:49:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:49:01,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:01,569 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-12-03 15:49:01,569 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:01,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash 971289792, now seen corresponding path program 13 times [2018-12-03 15:49:01,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:01,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:01,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:02,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:02,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:02,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:02,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:02,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:02,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:02,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:02,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:02,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:02,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:02,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:02,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:49:02,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:02,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:49:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:49:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:49:02,643 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-12-03 15:49:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:02,665 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-03 15:49:02,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:49:02,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 15:49:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:02,674 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:49:02,675 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:49:02,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:49:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:49:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:49:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:49:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-03 15:49:02,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-12-03 15:49:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:02,680 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-03 15:49:02,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:49:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-03 15:49:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:49:02,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:02,682 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1] [2018-12-03 15:49:02,682 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:02,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 971289854, now seen corresponding path program 12 times [2018-12-03 15:49:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:02,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:02,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:03,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:03,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:03,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:03,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:03,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:03,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:03,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:03,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:03,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:03,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:03,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:03,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:03,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:03,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 15:49:03,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:03,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:49:03,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:49:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:03,425 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 17 states. [2018-12-03 15:49:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:03,486 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-12-03 15:49:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:49:03,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-03 15:49:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:03,488 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:49:03,488 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:49:03,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:49:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:49:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:49:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-03 15:49:03,493 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-12-03 15:49:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:03,493 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-03 15:49:03,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:49:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-03 15:49:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:49:03,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:03,494 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-12-03 15:49:03,494 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:03,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1401638202, now seen corresponding path program 14 times [2018-12-03 15:49:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:03,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:03,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:03,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:03,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:03,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:03,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:03,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:03,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:03,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:03,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:03,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:49:03,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:03,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:03,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:49:04,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:04,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:49:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:49:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:04,106 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 17 states. [2018-12-03 15:49:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:04,276 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-03 15:49:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:49:04,276 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 15:49:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:04,277 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:49:04,277 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:49:04,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:49:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:49:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:49:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 15:49:04,283 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2018-12-03 15:49:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:04,284 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 15:49:04,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:49:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 15:49:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:49:04,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:04,285 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1] [2018-12-03 15:49:04,285 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:04,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1401638264, now seen corresponding path program 13 times [2018-12-03 15:49:04,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:04,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:04,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:04,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:04,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:04,597 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:04,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:04,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:04,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:04,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:04,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:04,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:05,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 15:49:05,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:05,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:49:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:49:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:49:05,150 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 18 states. [2018-12-03 15:49:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:05,184 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-12-03 15:49:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:49:05,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-12-03 15:49:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:05,185 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:49:05,185 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:49:05,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:49:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:49:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:49:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:49:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-03 15:49:05,190 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-12-03 15:49:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:05,190 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-03 15:49:05,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:49:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-03 15:49:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:49:05,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:05,191 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-12-03 15:49:05,192 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:05,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367500, now seen corresponding path program 15 times [2018-12-03 15:49:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:05,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:05,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:05,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:05,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:05,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:05,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:05,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:05,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:05,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:05,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:05,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:05,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:05,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:49:05,744 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:05,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:49:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:49:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:49:05,746 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 18 states. [2018-12-03 15:49:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:05,815 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-03 15:49:05,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:49:05,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 15:49:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:05,816 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:49:05,816 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:49:05,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:49:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:49:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:49:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:49:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 15:49:05,821 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2018-12-03 15:49:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:05,822 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 15:49:05,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:49:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 15:49:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:49:05,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:05,822 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1] [2018-12-03 15:49:05,823 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:05,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367438, now seen corresponding path program 14 times [2018-12-03 15:49:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:05,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:05,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:06,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:06,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:06,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:06,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:06,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:06,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:06,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:06,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:06,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:49:06,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:06,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:06,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:06,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 15:49:06,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:06,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:49:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:49:06,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:49:06,555 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 19 states. [2018-12-03 15:49:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:06,697 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-03 15:49:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:49:06,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-12-03 15:49:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:06,698 INFO L225 Difference]: With dead ends: 40 [2018-12-03 15:49:06,698 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:49:06,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:49:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:49:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:49:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:49:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-03 15:49:06,703 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-12-03 15:49:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:06,703 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-03 15:49:06,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:49:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-03 15:49:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:49:06,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:06,704 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-12-03 15:49:06,704 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:06,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash -650151250, now seen corresponding path program 16 times [2018-12-03 15:49:06,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:06,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:06,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:06,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:06,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:07,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:07,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:07,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:07,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:07,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:07,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:07,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:07,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:49:07,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:07,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:49:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:49:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:49:07,406 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 19 states. [2018-12-03 15:49:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:07,455 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-03 15:49:07,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:49:07,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 15:49:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:07,456 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:49:07,456 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:49:07,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:49:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:49:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:49:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:49:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 15:49:07,460 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2018-12-03 15:49:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:07,460 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 15:49:07,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:49:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 15:49:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:49:07,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:07,461 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1] [2018-12-03 15:49:07,461 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:07,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -650151188, now seen corresponding path program 15 times [2018-12-03 15:49:07,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:07,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:07,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:07,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:07,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:07,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:07,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:07,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:07,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:07,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:07,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:07,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:07,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:07,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:08,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:08,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 15:49:08,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:08,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:49:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:49:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:08,362 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2018-12-03 15:49:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:08,399 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-12-03 15:49:08,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:49:08,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-03 15:49:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:08,400 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:49:08,400 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:49:08,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:49:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:49:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:49:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-03 15:49:08,404 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-12-03 15:49:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:08,404 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-03 15:49:08,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:49:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-03 15:49:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:49:08,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:08,405 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-12-03 15:49:08,405 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:08,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2025042008, now seen corresponding path program 17 times [2018-12-03 15:49:08,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:08,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:08,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:08,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:08,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:08,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:08,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:08,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:08,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:08,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:08,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:08,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:49:08,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:08,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:08,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:49:09,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:09,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:49:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:49:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:09,352 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-12-03 15:49:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:09,404 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-03 15:49:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:49:09,405 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 15:49:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:09,406 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:49:09,406 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:49:09,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:49:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:49:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:49:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 15:49:09,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2018-12-03 15:49:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:09,412 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 15:49:09,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:49:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 15:49:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:49:09,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:09,413 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1] [2018-12-03 15:49:09,413 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:09,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2025041946, now seen corresponding path program 16 times [2018-12-03 15:49:09,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:09,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:09,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:09,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:09,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:09,686 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:09,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:09,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:09,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:09,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:09,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:09,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:09,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 15:49:10,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:10,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:49:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:49:10,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:49:10,221 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 21 states. [2018-12-03 15:49:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:10,264 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-03 15:49:10,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:49:10,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-12-03 15:49:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:10,265 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:49:10,266 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:49:10,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:49:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:49:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:49:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:49:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-03 15:49:10,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-12-03 15:49:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:10,270 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-03 15:49:10,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:49:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-03 15:49:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:49:10,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:10,270 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-12-03 15:49:10,270 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:10,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash -445133278, now seen corresponding path program 18 times [2018-12-03 15:49:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:10,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:10,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:10,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:10,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:10,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:10,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:10,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:10,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:10,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:10,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:11,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:49:11,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:11,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:49:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:49:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:49:11,535 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 21 states. [2018-12-03 15:49:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:11,561 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-03 15:49:11,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:49:11,561 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 15:49:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:11,562 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:49:11,562 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:49:11,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:49:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:49:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:49:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:49:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 15:49:11,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2018-12-03 15:49:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:11,567 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 15:49:11,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:49:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 15:49:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:49:11,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:11,567 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1] [2018-12-03 15:49:11,567 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:11,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -445133216, now seen corresponding path program 17 times [2018-12-03 15:49:11,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:11,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:11,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:11,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:11,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:11,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:11,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:11,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:11,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:11,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:11,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:49:11,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:11,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:12,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 15:49:12,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:12,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:49:12,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:49:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:49:12,298 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 22 states. [2018-12-03 15:49:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:12,491 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-12-03 15:49:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:49:12,492 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-12-03 15:49:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:12,493 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:49:12,493 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:49:12,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:49:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:49:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:49:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:49:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-03 15:49:12,498 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 40 [2018-12-03 15:49:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:12,498 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-03 15:49:12,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:49:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-03 15:49:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:49:12,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:12,501 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-12-03 15:49:12,501 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:12,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1723700764, now seen corresponding path program 19 times [2018-12-03 15:49:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:12,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:12,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:12,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:12,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:12,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:12,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:12,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:12,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:12,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:12,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:12,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:12,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:13,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:49:13,558 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:13,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:49:13,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:49:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:49:13,559 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 22 states. [2018-12-03 15:49:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:13,615 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-12-03 15:49:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:49:13,616 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 15:49:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:13,617 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:49:13,617 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:49:13,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:49:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:49:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:49:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:49:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-03 15:49:13,621 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2018-12-03 15:49:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:13,621 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-03 15:49:13,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:49:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-03 15:49:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:49:13,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:13,622 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1] [2018-12-03 15:49:13,622 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:13,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:13,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1723700826, now seen corresponding path program 18 times [2018-12-03 15:49:13,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:13,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:13,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:13,833 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:13,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:13,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:13,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:13,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:13,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:13,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:14,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:14,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 15:49:14,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:14,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:49:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:49:14,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:49:14,395 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 23 states. [2018-12-03 15:49:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:14,441 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-03 15:49:14,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:49:14,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-12-03 15:49:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:14,443 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:49:14,443 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:49:14,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:49:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:49:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:49:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:49:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 15:49:14,447 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-12-03 15:49:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:14,447 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 15:49:14,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:49:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 15:49:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:49:14,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:14,448 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-12-03 15:49:14,448 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:14,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:14,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1380890730, now seen corresponding path program 20 times [2018-12-03 15:49:14,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:14,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:14,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 21 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:14,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:14,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:14,964 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:14,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:14,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:14,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:14,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:14,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:49:14,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:14,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:15,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:16,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 15:49:16,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:16,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:49:16,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:49:16,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1287, Invalid=3135, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:49:16,066 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 45 states. [2018-12-03 15:49:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:17,094 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-03 15:49:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:49:17,094 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 15:49:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:17,095 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:49:17,095 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:49:17,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4101, Invalid=7671, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:49:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:49:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:49:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:49:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-03 15:49:17,100 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2018-12-03 15:49:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:17,101 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-03 15:49:17,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:49:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-03 15:49:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:49:17,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:17,102 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-12-03 15:49:17,102 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:17,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash 108954256, now seen corresponding path program 21 times [2018-12-03 15:49:17,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:17,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:17,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:17,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:17,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:17,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:17,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:17,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:17,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:17,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:17,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:17,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:17,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:17,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:17,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:17,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:17,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:18,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:49:18,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:18,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:49:18,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:49:18,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:49:18,081 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-12-03 15:49:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:18,190 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-03 15:49:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:49:18,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 15:49:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:18,191 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:49:18,191 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:49:18,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:49:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:49:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:49:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:49:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-03 15:49:18,193 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 46 [2018-12-03 15:49:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:18,194 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-03 15:49:18,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:49:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-03 15:49:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:49:18,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:18,194 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1] [2018-12-03 15:49:18,194 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:18,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash 108954318, now seen corresponding path program 19 times [2018-12-03 15:49:18,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:18,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:18,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:18,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:18,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:18,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:18,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:18,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:18,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:18,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:18,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:18,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:18,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:19,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:19,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 15:49:19,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:19,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:49:19,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:49:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:49:19,218 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 25 states. [2018-12-03 15:49:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:19,276 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-12-03 15:49:19,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:49:19,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-03 15:49:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:19,277 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:49:19,277 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:49:19,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:49:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:49:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:49:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:49:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-03 15:49:19,282 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 46 [2018-12-03 15:49:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:19,282 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-03 15:49:19,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:49:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-03 15:49:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:49:19,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:19,283 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-12-03 15:49:19,283 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:19,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1625876234, now seen corresponding path program 22 times [2018-12-03 15:49:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:19,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:19,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:19,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:19,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:19,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:19,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:19,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:19,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:19,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:19,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:19,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:20,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:20,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:49:20,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:20,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:49:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:49:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:49:20,513 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 25 states. [2018-12-03 15:49:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:20,557 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-12-03 15:49:20,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:49:20,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 15:49:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:20,558 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:49:20,558 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:49:20,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:49:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:49:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:49:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:49:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 15:49:20,562 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 48 [2018-12-03 15:49:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:20,563 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 15:49:20,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:49:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 15:49:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:49:20,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:20,563 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1] [2018-12-03 15:49:20,564 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:20,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1625876296, now seen corresponding path program 20 times [2018-12-03 15:49:20,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:20,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:20,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:20,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:20,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:20,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:20,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:20,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:20,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:20,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:20,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:20,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:49:20,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:20,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:20,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 15:49:21,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:21,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:49:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:49:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:21,563 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 26 states. [2018-12-03 15:49:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:21,619 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-03 15:49:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:49:21,620 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-12-03 15:49:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:21,621 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:49:21,621 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:49:21,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:49:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:49:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:49:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-12-03 15:49:21,625 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 48 [2018-12-03 15:49:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:21,625 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-12-03 15:49:21,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:49:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-12-03 15:49:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:49:21,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:21,626 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-12-03 15:49:21,626 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:21,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -900983548, now seen corresponding path program 23 times [2018-12-03 15:49:21,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:21,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:21,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:21,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:21,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:21,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:21,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:21,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:21,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:21,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:21,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:21,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:49:21,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:21,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:21,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:22,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:49:22,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:22,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:49:22,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:49:22,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:22,618 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 26 states. [2018-12-03 15:49:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:22,673 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-12-03 15:49:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:49:22,673 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 15:49:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:22,674 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:49:22,674 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:49:22,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:49:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:49:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:49:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 15:49:22,678 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 50 [2018-12-03 15:49:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:22,678 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 15:49:22,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:49:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 15:49:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:49:22,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:22,678 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1] [2018-12-03 15:49:22,679 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:22,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash -900983486, now seen corresponding path program 21 times [2018-12-03 15:49:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:22,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:22,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:23,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:23,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:23,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:23,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:23,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:23,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:23,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:23,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:23,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:23,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:23,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:23,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:24,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:24,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 15:49:24,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:24,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:49:24,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:49:24,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:24,016 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 27 states. [2018-12-03 15:49:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:24,062 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-03 15:49:24,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:49:24,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-12-03 15:49:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:24,063 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:49:24,063 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:49:24,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:49:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:49:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:49:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-03 15:49:24,067 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 50 [2018-12-03 15:49:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:24,068 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-03 15:49:24,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:49:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-03 15:49:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:49:24,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:24,068 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-12-03 15:49:24,069 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:24,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1738255486, now seen corresponding path program 24 times [2018-12-03 15:49:24,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:24,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:24,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:24,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:24,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:24,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:24,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:24,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:24,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:24,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:24,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:24,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:24,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:25,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:25,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:49:25,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:25,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:49:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:49:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:25,199 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 27 states. [2018-12-03 15:49:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:25,268 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-03 15:49:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:49:25,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 15:49:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:25,270 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:49:25,270 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:49:25,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:49:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:49:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:49:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-03 15:49:25,274 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2018-12-03 15:49:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:25,275 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-03 15:49:25,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:49:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-03 15:49:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:49:25,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:25,275 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1] [2018-12-03 15:49:25,276 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:25,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1738255548, now seen corresponding path program 22 times [2018-12-03 15:49:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:25,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:25,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:25,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:25,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:25,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:25,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:25,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:25,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:25,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:25,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:25,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:25,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:26,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 15:49:26,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:26,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:49:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:49:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:49:26,362 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 28 states. [2018-12-03 15:49:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:26,418 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-12-03 15:49:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:49:26,419 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-12-03 15:49:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:26,419 INFO L225 Difference]: With dead ends: 58 [2018-12-03 15:49:26,419 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:49:26,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:49:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:49:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:49:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:49:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-03 15:49:26,425 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 52 [2018-12-03 15:49:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:26,425 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-03 15:49:26,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:49:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-03 15:49:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:49:26,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:26,426 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-12-03 15:49:26,426 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:26,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash -278704776, now seen corresponding path program 25 times [2018-12-03 15:49:26,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:26,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:26,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:26,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:26,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:26,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:26,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:26,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:26,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:26,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:26,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:27,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:27,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:27,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:27,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:49:27,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:27,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:49:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:49:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:49:27,738 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 28 states. [2018-12-03 15:49:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:27,794 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-12-03 15:49:27,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:49:27,795 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 15:49:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:27,795 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:49:27,796 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:49:27,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:49:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:49:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 15:49:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:49:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 15:49:27,800 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 54 [2018-12-03 15:49:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:27,800 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 15:49:27,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:49:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 15:49:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:49:27,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:27,801 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1] [2018-12-03 15:49:27,801 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:27,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash -278704714, now seen corresponding path program 23 times [2018-12-03 15:49:27,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:27,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:27,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:28,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:28,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:28,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:28,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:28,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:28,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:28,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:28,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:49:28,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:28,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:28,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:29,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:29,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 15:49:29,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:29,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:49:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:49:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:49:29,708 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 29 states. [2018-12-03 15:49:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:29,750 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-03 15:49:29,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:49:29,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-12-03 15:49:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:29,751 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:49:29,751 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:49:29,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:49:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:49:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:49:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:49:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-03 15:49:29,757 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 54 [2018-12-03 15:49:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:29,758 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-03 15:49:29,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:49:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-03 15:49:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:49:29,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:29,759 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-12-03 15:49:29,759 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:29,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1547266062, now seen corresponding path program 26 times [2018-12-03 15:49:29,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:29,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:29,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 27 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:30,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:30,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:30,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:30,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:30,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:30,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:30,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:30,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:30,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:49:30,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:30,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:31,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:32,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:32,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 15:49:32,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:32,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:49:32,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:49:32,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2058, Invalid=5082, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:49:32,679 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 57 states. [2018-12-03 15:49:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:34,734 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-12-03 15:49:34,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:49:34,734 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-12-03 15:49:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:34,735 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:49:34,736 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:49:34,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2887 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6648, Invalid=12534, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:49:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:49:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:49:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:49:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-03 15:49:34,740 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 56 [2018-12-03 15:49:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:34,740 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-03 15:49:34,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:49:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-03 15:49:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:49:34,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:34,741 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-12-03 15:49:34,741 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:34,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:34,742 INFO L82 PathProgramCache]: Analyzing trace with hash -863949844, now seen corresponding path program 27 times [2018-12-03 15:49:34,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:34,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:35,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:35,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:35,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:35,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:35,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:35,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:35,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:35,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:35,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:36,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:49:36,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:36,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:49:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:49:36,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:49:36,026 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 30 states. [2018-12-03 15:49:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:36,088 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-03 15:49:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:49:36,089 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 15:49:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:36,089 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:49:36,090 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:49:36,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:49:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:49:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:49:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:49:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 15:49:36,093 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 58 [2018-12-03 15:49:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:36,093 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 15:49:36,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:49:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 15:49:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:49:36,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:36,094 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1] [2018-12-03 15:49:36,094 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:36,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash -863949782, now seen corresponding path program 24 times [2018-12-03 15:49:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:36,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:36,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:36,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:36,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:36,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:36,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:36,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:36,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 15:49:37,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:49:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:49:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:49:37,431 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 31 states. [2018-12-03 15:49:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,496 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-12-03 15:49:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:49:37,497 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-12-03 15:49:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,497 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:49:37,498 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:49:37,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:49:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:49:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:49:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:49:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-03 15:49:37,502 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 58 [2018-12-03 15:49:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,502 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-03 15:49:37,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:49:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-03 15:49:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:49:37,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,503 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-12-03 15:49:37,503 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1327060634, now seen corresponding path program 28 times [2018-12-03 15:49:37,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:37,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:37,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:37,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:37,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:37,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:39,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:39,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:49:39,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:39,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:49:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:49:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:49:39,329 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 31 states. [2018-12-03 15:49:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:39,401 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-12-03 15:49:39,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:49:39,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 15:49:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:39,403 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:49:39,403 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:49:39,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:49:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:49:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:49:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:49:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 15:49:39,407 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 60 [2018-12-03 15:49:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:39,407 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 15:49:39,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:49:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 15:49:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:49:39,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:39,408 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1] [2018-12-03 15:49:39,408 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1327060572, now seen corresponding path program 25 times [2018-12-03 15:49:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:39,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:39,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:39,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:39,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:39,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:39,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:39,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:39,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:39,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:39,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:39,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:40,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:40,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 15:49:40,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:40,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:49:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:49:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:49:40,971 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2018-12-03 15:49:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:41,125 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-12-03 15:49:41,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:49:41,126 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-12-03 15:49:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:41,127 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:49:41,127 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:49:41,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:49:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:49:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:49:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:49:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-03 15:49:41,131 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2018-12-03 15:49:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:41,132 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-03 15:49:41,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:49:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-03 15:49:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:49:41,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:41,132 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-12-03 15:49:41,133 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:41,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash 300068960, now seen corresponding path program 29 times [2018-12-03 15:49:41,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:41,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:41,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:41,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:41,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:41,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:41,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:41,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:41,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:41,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:49:41,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:41,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:41,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:43,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:49:43,020 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:43,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:49:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:49:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:49:43,021 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 32 states. [2018-12-03 15:49:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:43,092 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-03 15:49:43,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:49:43,092 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 15:49:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:43,093 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:49:43,093 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:49:43,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:49:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:49:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:49:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:49:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-12-03 15:49:43,099 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 62 [2018-12-03 15:49:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:43,100 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-12-03 15:49:43,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:49:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-12-03 15:49:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:49:43,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:43,100 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1] [2018-12-03 15:49:43,101 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:43,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 300069022, now seen corresponding path program 26 times [2018-12-03 15:49:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:43,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:43,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:43,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:43,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:43,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:43,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:43,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:43,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:43,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:43,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:43,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:49:43,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:43,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:43,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:45,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:45,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 15:49:45,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:45,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:49:45,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:49:45,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:49:45,035 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 33 states. [2018-12-03 15:49:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:45,106 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-12-03 15:49:45,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:49:45,107 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-12-03 15:49:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:45,107 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:49:45,107 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:49:45,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:49:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:49:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 15:49:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:49:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 15:49:45,111 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2018-12-03 15:49:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:45,111 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 15:49:45,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:49:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 15:49:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:49:45,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:45,112 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-12-03 15:49:45,112 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:45,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash 603513050, now seen corresponding path program 30 times [2018-12-03 15:49:45,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:45,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:45,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:45,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:45,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:45,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:45,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:45,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:45,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:45,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:45,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:45,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:45,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:45,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:45,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:45,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:45,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:46,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:49:46,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:46,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:49:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:49:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:49:46,713 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 33 states. [2018-12-03 15:49:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:46,778 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-03 15:49:46,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:49:46,779 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 15:49:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:46,780 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:49:46,780 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:49:46,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:49:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:49:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:49:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:49:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 15:49:46,784 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 64 [2018-12-03 15:49:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:46,784 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 15:49:46,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:49:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 15:49:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:49:46,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:46,785 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1] [2018-12-03 15:49:46,785 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:46,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash 603513112, now seen corresponding path program 27 times [2018-12-03 15:49:46,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:46,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:46,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:47,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:47,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:47,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:47,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:47,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:47,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:47,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:47,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:47,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:47,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:47,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:47,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:48,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:48,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 15:49:48,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:48,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:49:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:49:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:49:48,454 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 34 states. [2018-12-03 15:49:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:48,524 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-03 15:49:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:49:48,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-12-03 15:49:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:48,525 INFO L225 Difference]: With dead ends: 70 [2018-12-03 15:49:48,525 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:49:48,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:49:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:49:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:49:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:49:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-03 15:49:48,529 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2018-12-03 15:49:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:48,529 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-03 15:49:48,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:49:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-03 15:49:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:49:48,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:48,530 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-12-03 15:49:48,530 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:48,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash 155507412, now seen corresponding path program 31 times [2018-12-03 15:49:48,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:48,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:48,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:49,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:49,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:49,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:49,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:49,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:49,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:49,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:50,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:50,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:49:50,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:50,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:49:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:49:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:49:50,537 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 34 states. [2018-12-03 15:49:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:50,833 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-12-03 15:49:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:49:50,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 15:49:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:50,834 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:49:50,835 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:49:50,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:49:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:49:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:49:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:49:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 15:49:50,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 66 [2018-12-03 15:49:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:50,838 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 15:49:50,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:49:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 15:49:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:49:50,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:50,839 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1] [2018-12-03 15:49:50,839 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:50,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash 155507474, now seen corresponding path program 28 times [2018-12-03 15:49:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:51,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:51,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:51,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:51,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:51,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:51,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:51,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:51,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:52,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:52,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 15:49:52,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:52,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:49:52,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:49:52,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:49:52,752 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 35 states. [2018-12-03 15:49:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:52,829 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-12-03 15:49:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:49:52,829 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-12-03 15:49:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:52,830 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:49:52,830 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:49:52,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:49:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:49:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 15:49:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:49:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 15:49:52,834 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2018-12-03 15:49:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 15:49:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:49:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 15:49:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:49:52,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:52,835 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-12-03 15:49:52,835 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:52,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash -881181106, now seen corresponding path program 32 times [2018-12-03 15:49:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:52,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:52,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:52,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:52,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:53,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:53,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:53,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:53,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:53,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:53,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:53,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:53,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:49:53,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:53,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:54,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:56,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 15:49:56,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:49:56,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:49:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3009, Invalid=7497, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:49:56,202 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 69 states. [2018-12-03 15:49:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:58,464 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-03 15:49:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:49:58,464 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-12-03 15:49:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:58,465 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:49:58,466 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:49:58,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4321 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9807, Invalid=18585, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 15:49:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:49:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 15:49:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 15:49:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-12-03 15:49:58,470 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2018-12-03 15:49:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:58,470 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-12-03 15:49:58,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:49:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-12-03 15:49:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:49:58,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:58,471 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-12-03 15:49:58,471 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:58,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash -706434232, now seen corresponding path program 33 times [2018-12-03 15:49:58,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:58,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:58,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:58,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:58,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:58,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:58,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:58,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:58,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:58,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:58,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:59,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:59,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:59,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:59,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:00,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:50:00,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:00,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:50:00,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:50:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:50:00,530 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 36 states. [2018-12-03 15:50:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:00,608 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-03 15:50:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:50:00,608 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 15:50:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:00,609 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:50:00,609 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:50:00,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:50:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:50:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 15:50:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:50:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-12-03 15:50:00,614 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 70 [2018-12-03 15:50:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:00,615 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-12-03 15:50:00,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:50:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-12-03 15:50:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:50:00,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:00,615 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1] [2018-12-03 15:50:00,616 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:00,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:00,616 INFO L82 PathProgramCache]: Analyzing trace with hash -706434170, now seen corresponding path program 29 times [2018-12-03 15:50:00,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:00,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:00,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:01,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:01,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:01,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:01,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:01,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:01,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:01,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:01,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:01,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 15:50:01,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:01,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:01,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:02,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:02,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 15:50:02,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:02,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:50:02,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:50:02,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:50:02,541 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 37 states. [2018-12-03 15:50:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:02,619 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-03 15:50:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:50:02,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-12-03 15:50:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:02,621 INFO L225 Difference]: With dead ends: 76 [2018-12-03 15:50:02,621 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:50:02,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:50:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:50:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:50:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:50:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-03 15:50:02,624 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 70 [2018-12-03 15:50:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:02,624 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-03 15:50:02,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:50:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-03 15:50:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:50:02,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:02,625 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-12-03 15:50:02,625 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:02,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash -278412862, now seen corresponding path program 34 times [2018-12-03 15:50:02,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:02,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:02,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:03,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:03,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:03,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:03,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:03,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:03,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:03,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:03,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:03,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:04,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:04,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 15:50:04,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:04,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:50:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:50:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:50:04,871 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 37 states. [2018-12-03 15:50:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:05,156 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-03 15:50:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:50:05,157 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 15:50:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:05,158 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:50:05,158 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:50:05,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:50:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:50:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:50:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:50:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 15:50:05,161 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 72 [2018-12-03 15:50:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:05,162 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 15:50:05,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:50:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 15:50:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:50:05,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:05,162 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1] [2018-12-03 15:50:05,162 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:05,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -278412800, now seen corresponding path program 30 times [2018-12-03 15:50:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:05,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:05,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:05,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:05,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:05,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:05,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:05,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:05,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:05,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:05,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:05,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:05,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:05,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:05,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:07,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-12-03 15:50:07,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:07,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:50:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:50:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:07,151 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 38 states. [2018-12-03 15:50:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:07,255 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-12-03 15:50:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:50:07,256 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-12-03 15:50:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:07,257 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:50:07,257 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:50:07,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:50:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:50:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:50:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-12-03 15:50:07,261 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 72 [2018-12-03 15:50:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:07,262 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-12-03 15:50:07,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:50:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-12-03 15:50:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:50:07,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:07,262 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-12-03 15:50:07,262 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:07,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1266736708, now seen corresponding path program 35 times [2018-12-03 15:50:07,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:07,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:07,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:07,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:07,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:07,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:07,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:07,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:07,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 15:50:07,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:07,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:09,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:09,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:50:09,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:09,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:50:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:50:09,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:09,645 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 38 states. [2018-12-03 15:50:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:10,339 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-12-03 15:50:10,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:50:10,339 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 15:50:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:10,340 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:50:10,340 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:50:10,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:50:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:50:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:50:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 15:50:10,345 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 74 [2018-12-03 15:50:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:10,345 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 15:50:10,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:50:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 15:50:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:50:10,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:10,346 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1] [2018-12-03 15:50:10,346 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:10,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1266736646, now seen corresponding path program 31 times [2018-12-03 15:50:10,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:10,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:10,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:10,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:10,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:10,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:10,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:10,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:10,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:10,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:10,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:10,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:10,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:12,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:12,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 15:50:12,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:12,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:50:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:50:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:50:12,658 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 39 states. [2018-12-03 15:50:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:12,747 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-12-03 15:50:12,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:50:12,748 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-12-03 15:50:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:12,748 INFO L225 Difference]: With dead ends: 80 [2018-12-03 15:50:12,749 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:50:12,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:50:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:50:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 15:50:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:50:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-12-03 15:50:12,754 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 74 [2018-12-03 15:50:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:12,754 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-12-03 15:50:12,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:50:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-12-03 15:50:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:50:12,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:12,755 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-12-03 15:50:12,755 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:12,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:12,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1858180298, now seen corresponding path program 36 times [2018-12-03 15:50:12,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:12,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:12,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:13,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:13,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:13,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:13,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:13,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:13,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:13,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:13,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:15,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:15,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 15:50:15,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:15,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:50:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:50:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:50:15,058 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 39 states. [2018-12-03 15:50:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:15,142 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-03 15:50:15,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:50:15,143 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 15:50:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:15,143 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:50:15,144 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:50:15,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:50:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:50:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 15:50:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:50:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-03 15:50:15,149 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 76 [2018-12-03 15:50:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:15,149 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-03 15:50:15,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:50:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-03 15:50:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:50:15,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:15,150 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1] [2018-12-03 15:50:15,150 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:15,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1858180236, now seen corresponding path program 32 times [2018-12-03 15:50:15,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:15,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:15,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:16,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:16,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:16,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:16,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:16,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:16,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:16,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:16,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:50:16,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:16,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:16,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:17,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 76 [2018-12-03 15:50:17,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:17,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:50:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:50:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:50:17,968 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 40 states. [2018-12-03 15:50:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:18,149 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-12-03 15:50:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:50:18,150 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-12-03 15:50:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:18,151 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:50:18,151 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:50:18,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:50:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:50:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:50:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:50:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-12-03 15:50:18,156 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 76 [2018-12-03 15:50:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:18,156 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-12-03 15:50:18,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:50:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-12-03 15:50:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:50:18,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:18,157 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-12-03 15:50:18,157 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:18,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash 995180080, now seen corresponding path program 37 times [2018-12-03 15:50:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:18,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:18,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:18,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:18,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:18,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:18,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:18,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:18,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:18,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:18,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:18,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:18,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:50:20,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:20,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:50:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:50:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:50:20,617 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 40 states. [2018-12-03 15:50:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:20,701 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-03 15:50:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:50:20,701 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 15:50:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:20,702 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:50:20,702 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:50:20,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:50:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:50:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:50:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:50:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 15:50:20,706 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 78 [2018-12-03 15:50:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:20,707 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 15:50:20,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:50:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 15:50:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:50:20,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:20,707 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1] [2018-12-03 15:50:20,708 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:20,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 995180142, now seen corresponding path program 33 times [2018-12-03 15:50:20,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:20,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:21,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:21,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:21,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:21,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:21,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:21,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:21,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:21,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:21,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:21,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:21,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:21,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:22,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:22,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 15:50:22,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:22,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:50:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:50:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:22,979 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 41 states. [2018-12-03 15:50:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:23,067 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-03 15:50:23,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:50:23,068 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-12-03 15:50:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:23,069 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:50:23,069 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:50:23,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:50:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 15:50:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:50:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-03 15:50:23,071 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 78 [2018-12-03 15:50:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:23,072 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-03 15:50:23,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:50:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-03 15:50:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:50:23,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:23,072 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-12-03 15:50:23,072 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:23,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1409598806, now seen corresponding path program 38 times [2018-12-03 15:50:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:23,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:23,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:23,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 39 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:25,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:25,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:25,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:25,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:25,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:25,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:25,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:25,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:25,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:50:25,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:25,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:26,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:28,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:28,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 15:50:28,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:28,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:50:28,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:50:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4140, Invalid=10380, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:50:28,581 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 81 states. [2018-12-03 15:50:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:31,852 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-12-03 15:50:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:50:31,852 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-12-03 15:50:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:31,853 INFO L225 Difference]: With dead ends: 86 [2018-12-03 15:50:31,853 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:50:31,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6043 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13578, Invalid=25824, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:50:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:50:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:50:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:50:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-12-03 15:50:31,859 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 80 [2018-12-03 15:50:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:31,859 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-12-03 15:50:31,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:50:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-12-03 15:50:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:50:31,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:31,860 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-12-03 15:50:31,860 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:31,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1709703004, now seen corresponding path program 39 times [2018-12-03 15:50:31,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:31,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:31,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:32,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:32,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:32,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:32,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:32,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:32,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:32,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:32,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:32,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:32,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:32,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:34,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:34,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:50:34,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:34,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:50:34,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:50:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:50:34,660 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 42 states. [2018-12-03 15:50:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:34,750 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-12-03 15:50:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:50:34,751 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 15:50:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:34,752 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:50:34,752 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:50:34,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:50:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:50:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:50:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:50:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 15:50:34,755 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 82 [2018-12-03 15:50:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:34,756 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 15:50:34,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:50:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 15:50:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:50:34,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:34,756 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1] [2018-12-03 15:50:34,756 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:34,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1709702942, now seen corresponding path program 34 times [2018-12-03 15:50:34,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:34,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:34,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:35,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:35,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:35,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:35,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:35,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:35,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:35,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:35,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:35,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:37,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:37,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 15:50:37,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:37,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:50:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:50:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:50:37,433 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 43 states. [2018-12-03 15:50:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:37,527 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-12-03 15:50:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:50:37,527 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-12-03 15:50:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:37,528 INFO L225 Difference]: With dead ends: 88 [2018-12-03 15:50:37,528 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:50:37,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:50:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:50:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:50:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:50:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-12-03 15:50:37,533 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 82 [2018-12-03 15:50:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:37,533 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-12-03 15:50:37,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:50:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-12-03 15:50:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:50:37,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:37,534 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-12-03 15:50:37,534 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:37,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1947938846, now seen corresponding path program 40 times [2018-12-03 15:50:37,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:37,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:37,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:39,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:39,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:39,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:39,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:39,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:39,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:39,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:39,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:39,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:39,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:41,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:41,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 15:50:41,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:50:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:50:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:50:41,187 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 43 states. [2018-12-03 15:50:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:41,282 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-03 15:50:41,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:50:41,282 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 15:50:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:41,283 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:50:41,283 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 15:50:41,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:50:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 15:50:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 15:50:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:50:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 15:50:41,286 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 84 [2018-12-03 15:50:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:41,286 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 15:50:41,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:50:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 15:50:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:50:41,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:41,287 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1] [2018-12-03 15:50:41,287 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:41,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1947938908, now seen corresponding path program 35 times [2018-12-03 15:50:41,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:41,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:41,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:41,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:42,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:42,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:42,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:42,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:42,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:42,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:42,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:42,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 15:50:42,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:42,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:42,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:43,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 84 [2018-12-03 15:50:43,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:43,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:50:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:50:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:43,951 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 44 states. [2018-12-03 15:50:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:44,047 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-12-03 15:50:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:50:44,047 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-12-03 15:50:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:44,048 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:50:44,048 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:50:44,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:50:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 15:50:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:50:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-03 15:50:44,051 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 84 [2018-12-03 15:50:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:44,051 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-03 15:50:44,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:50:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-03 15:50:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:50:44,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:44,052 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-12-03 15:50:44,052 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:44,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -636458728, now seen corresponding path program 41 times [2018-12-03 15:50:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:44,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:44,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:44,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:44,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:44,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:44,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:44,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:44,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:44,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:44,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:44,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 15:50:44,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:44,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:44,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:50:47,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:47,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:50:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:50:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:47,611 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 44 states. [2018-12-03 15:50:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:47,670 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-12-03 15:50:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:50:47,670 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 15:50:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:47,671 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:50:47,671 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:50:47,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:50:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:50:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:50:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-12-03 15:50:47,676 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 86 [2018-12-03 15:50:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:47,676 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-12-03 15:50:47,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:50:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-12-03 15:50:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:50:47,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:47,677 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1] [2018-12-03 15:50:47,677 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:47,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash -636458666, now seen corresponding path program 36 times [2018-12-03 15:50:47,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:47,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:47,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:47,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:48,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:48,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:48,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:48,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:48,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:48,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:48,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:48,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:48,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:48,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:48,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:48,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:50,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:50,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 15:50:50,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:50,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:50:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:50:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:50:50,732 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 45 states. [2018-12-03 15:50:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:50,827 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-12-03 15:50:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:50:50,828 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-12-03 15:50:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:50,829 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:50:50,829 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:50:50,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:50:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:50:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 15:50:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 15:50:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-12-03 15:50:50,833 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 86 [2018-12-03 15:50:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:50,834 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-12-03 15:50:50,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:50:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-12-03 15:50:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 15:50:50,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:50,834 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-12-03 15:50:50,835 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:50,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1751430254, now seen corresponding path program 42 times [2018-12-03 15:50:50,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:50,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:50,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:51,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:51,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:51,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:51,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:51,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:51,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:51,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:51,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:51,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:51,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:53,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:53,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 15:50:53,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:53,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:50:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:50:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:50:53,639 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 45 states. [2018-12-03 15:50:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:53,698 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-03 15:50:53,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:50:53,699 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 15:50:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:53,699 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:50:53,700 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:50:53,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:50:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:50:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 15:50:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:50:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 15:50:53,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 88 [2018-12-03 15:50:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:53,704 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 15:50:53,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:50:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 15:50:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 15:50:53,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:53,705 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1] [2018-12-03 15:50:53,705 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:53,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1751430192, now seen corresponding path program 37 times [2018-12-03 15:50:53,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:53,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:53,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:54,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:54,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:54,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:54,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:54,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:54,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:54,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:54,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:54,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:56,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:56,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 88 [2018-12-03 15:50:56,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:56,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:50:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:50:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:50:56,966 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 46 states. [2018-12-03 15:50:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:58,204 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-03 15:50:58,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:50:58,205 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-12-03 15:50:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:58,206 INFO L225 Difference]: With dead ends: 94 [2018-12-03 15:50:58,206 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:50:58,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:50:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:50:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:50:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:50:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-12-03 15:50:58,210 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 88 [2018-12-03 15:50:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:58,210 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-12-03 15:50:58,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:50:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-12-03 15:50:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:50:58,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:58,211 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-12-03 15:50:58,211 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:58,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 502757260, now seen corresponding path program 43 times [2018-12-03 15:50:58,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:58,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:58,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:58,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:58,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:58,992 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:58,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:58,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:58,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:59,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:59,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:59,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:59,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:01,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:01,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:51:01,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:01,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:51:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:51:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:51:01,293 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 46 states. [2018-12-03 15:51:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:01,574 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-03 15:51:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:51:01,575 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 15:51:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:01,575 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:51:01,575 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:51:01,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:51:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:51:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:51:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:51:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-12-03 15:51:01,578 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 90 [2018-12-03 15:51:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:01,578 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-12-03 15:51:01,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:51:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-12-03 15:51:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:51:01,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:01,579 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1] [2018-12-03 15:51:01,579 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:01,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash 502757322, now seen corresponding path program 38 times [2018-12-03 15:51:01,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:01,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:01,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:02,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:02,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:02,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:02,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:02,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:02,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:02,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:02,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 15:51:02,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:02,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:02,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:04,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:04,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 15:51:04,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:04,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:51:04,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:51:04,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:51:04,549 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 47 states. [2018-12-03 15:51:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:04,651 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-12-03 15:51:04,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:51:04,651 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-12-03 15:51:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:04,652 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:51:04,652 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 15:51:04,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:51:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 15:51:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 15:51:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:51:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-12-03 15:51:04,657 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2018-12-03 15:51:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:04,657 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-12-03 15:51:04,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:51:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-12-03 15:51:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:51:04,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:04,658 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-12-03 15:51:04,658 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:04,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2113441030, now seen corresponding path program 44 times [2018-12-03 15:51:04,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:04,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:04,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:04,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:04,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 45 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:05,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:05,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:05,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:05,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:05,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:05,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:51:05,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:05,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:07,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:10,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:10,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 15:51:10,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:10,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 15:51:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 15:51:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5451, Invalid=13731, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:51:10,271 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 93 states. [2018-12-03 15:51:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:14,741 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-12-03 15:51:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:51:14,742 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-12-03 15:51:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:14,742 INFO L225 Difference]: With dead ends: 98 [2018-12-03 15:51:14,743 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:51:14,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8053 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17961, Invalid=34251, Unknown=0, NotChecked=0, Total=52212 [2018-12-03 15:51:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:51:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 15:51:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 15:51:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-12-03 15:51:14,749 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2018-12-03 15:51:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:14,749 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-12-03 15:51:14,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 15:51:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-12-03 15:51:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 15:51:14,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:14,750 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-12-03 15:51:14,750 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:14,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash -502649856, now seen corresponding path program 45 times [2018-12-03 15:51:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:14,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:14,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:15,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:15,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:15,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:15,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:15,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:15,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:15,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:15,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:15,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:15,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:15,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:15,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:18,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:51:18,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:18,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:51:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:51:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:51:18,084 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 48 states. [2018-12-03 15:51:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:18,149 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-12-03 15:51:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:51:18,149 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 15:51:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:18,150 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:51:18,150 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 15:51:18,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:51:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 15:51:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 15:51:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:51:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 15:51:18,155 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 94 [2018-12-03 15:51:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:18,156 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 15:51:18,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:51:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 15:51:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 15:51:18,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:18,157 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1] [2018-12-03 15:51:18,157 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:18,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash -502649794, now seen corresponding path program 39 times [2018-12-03 15:51:18,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:18,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:18,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:18,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:18,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:18,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:18,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:18,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:18,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:19,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:19,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:19,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:19,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:19,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:21,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:21,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 15:51:21,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:21,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:51:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:51:21,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:51:21,740 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 49 states. [2018-12-03 15:51:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:21,842 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-03 15:51:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:51:21,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-12-03 15:51:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:21,843 INFO L225 Difference]: With dead ends: 100 [2018-12-03 15:51:21,843 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:51:21,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:51:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:51:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:51:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:51:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-03 15:51:21,847 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2018-12-03 15:51:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:21,848 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-03 15:51:21,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:51:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-03 15:51:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:51:21,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:21,848 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-12-03 15:51:21,849 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:21,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2010123142, now seen corresponding path program 46 times [2018-12-03 15:51:21,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:21,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:21,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:23,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:23,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:23,215 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:23,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:23,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:23,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:23,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:23,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:23,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:23,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:25,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:25,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 15:51:25,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:25,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:51:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:51:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:51:25,581 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 49 states. [2018-12-03 15:51:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:25,719 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-12-03 15:51:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:51:25,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 15:51:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:25,720 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:51:25,721 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:51:25,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:51:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:51:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:51:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:51:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 15:51:25,725 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 96 [2018-12-03 15:51:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:25,725 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 15:51:25,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:51:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 15:51:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:51:25,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:25,725 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1] [2018-12-03 15:51:25,725 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:25,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2010123080, now seen corresponding path program 40 times [2018-12-03 15:51:25,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:25,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:25,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:26,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:26,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:26,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:26,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:26,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:26,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:26,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:26,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:26,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:26,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:29,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:29,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-12-03 15:51:29,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:29,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:51:29,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:51:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:51:29,717 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 50 states. [2018-12-03 15:51:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:29,824 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-03 15:51:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:51:29,824 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-12-03 15:51:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:29,825 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:51:29,825 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:51:29,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:51:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:51:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 15:51:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:51:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-12-03 15:51:29,829 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2018-12-03 15:51:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:29,830 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-12-03 15:51:29,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:51:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-12-03 15:51:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:51:29,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:29,831 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-12-03 15:51:29,831 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:29,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1006995060, now seen corresponding path program 47 times [2018-12-03 15:51:29,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:29,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:29,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:29,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:29,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:30,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:30,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:30,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:30,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:30,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:30,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:30,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:30,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:51:30,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:30,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:30,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:33,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:33,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:51:33,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:33,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:51:33,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:51:33,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:51:33,732 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 50 states. [2018-12-03 15:51:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:33,843 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-12-03 15:51:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:51:33,844 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 15:51:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:33,844 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:51:33,844 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:51:33,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:51:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:51:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:51:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:51:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 15:51:33,848 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 98 [2018-12-03 15:51:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:33,849 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 15:51:33,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:51:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 15:51:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:51:33,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:33,849 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1] [2018-12-03 15:51:33,849 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:33,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1006995122, now seen corresponding path program 41 times [2018-12-03 15:51:33,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:33,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:33,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:33,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:33,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:34,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:34,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:34,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:34,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:34,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:34,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:34,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:34,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:34,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:51:34,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:34,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:34,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:37,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 15:51:37,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:37,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:51:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:51:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:51:37,902 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 51 states. [2018-12-03 15:51:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:37,977 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-12-03 15:51:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:51:37,978 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-12-03 15:51:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:37,979 INFO L225 Difference]: With dead ends: 104 [2018-12-03 15:51:37,979 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:51:37,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:51:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:51:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 15:51:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 15:51:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 15:51:37,983 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2018-12-03 15:51:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:37,983 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 15:51:37,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:51:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 15:51:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:51:37,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:37,984 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-12-03 15:51:37,984 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:37,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:37,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1354662382, now seen corresponding path program 48 times [2018-12-03 15:51:37,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:37,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:37,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:38,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:38,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:38,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:38,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:38,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:38,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:38,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:38,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:38,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:38,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:38,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:42,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:42,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 15:51:42,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:42,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:51:42,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:51:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:51:42,204 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 51 states. [2018-12-03 15:51:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:42,375 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-03 15:51:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:51:42,375 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 15:51:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:42,376 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:51:42,376 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 15:51:42,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:51:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 15:51:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 15:51:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:51:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-03 15:51:42,380 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 100 [2018-12-03 15:51:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:42,380 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-03 15:51:42,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:51:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-03 15:51:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:51:42,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:42,384 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1] [2018-12-03 15:51:42,384 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:42,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1354662444, now seen corresponding path program 42 times [2018-12-03 15:51:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:42,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:42,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:43,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:43,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:43,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:43,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:43,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:43,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:43,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:43,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:43,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:43,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:43,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:43,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:45,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2018-12-03 15:51:45,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:45,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:51:45,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:51:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:45,957 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 52 states. [2018-12-03 15:51:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:46,086 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-12-03 15:51:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:51:46,087 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-12-03 15:51:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:46,088 INFO L225 Difference]: With dead ends: 106 [2018-12-03 15:51:46,088 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:51:46,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:51:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:51:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:51:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-12-03 15:51:46,093 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 100 [2018-12-03 15:51:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:46,093 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-12-03 15:51:46,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:51:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-12-03 15:51:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:51:46,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:46,094 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-12-03 15:51:46,094 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:46,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash 455509736, now seen corresponding path program 49 times [2018-12-03 15:51:46,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:46,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:46,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:46,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:47,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:47,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:47,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:47,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:47,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:47,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:47,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:47,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:47,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:47,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:50,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:50,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:51:50,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:50,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:51:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:51:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:50,128 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 52 states. [2018-12-03 15:51:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:50,242 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-03 15:51:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:51:50,242 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 15:51:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:50,243 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:51:50,243 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:51:50,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:51:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 15:51:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:51:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 15:51:50,248 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 102 [2018-12-03 15:51:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:50,248 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 15:51:50,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:51:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 15:51:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:51:50,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:50,249 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1] [2018-12-03 15:51:50,249 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:50,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash 455509798, now seen corresponding path program 43 times [2018-12-03 15:51:50,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:50,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:50,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:51,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:51,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:51,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:51,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:51,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:51,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:51,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:51,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:51,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:51,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:54,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-12-03 15:51:54,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:54,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:51:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:51:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:54,759 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 53 states. [2018-12-03 15:51:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:54,875 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-12-03 15:51:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:51:54,875 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-12-03 15:51:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:54,876 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:51:54,876 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:51:54,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:51:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 15:51:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:51:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 15:51:54,879 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 102 [2018-12-03 15:51:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:54,879 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 15:51:54,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:51:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 15:51:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:51:54,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:54,880 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-12-03 15:51:54,880 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:54,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash -341756574, now seen corresponding path program 50 times [2018-12-03 15:51:54,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:54,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:54,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 51 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:56,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:56,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:56,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:56,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:56,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:56,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:56,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:56,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:51:56,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:56,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:58,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:02,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:02,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2018-12-03 15:52:02,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:02,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 15:52:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 15:52:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6528, Invalid=16728, Unknown=0, NotChecked=0, Total=23256 [2018-12-03 15:52:02,593 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 105 states. [2018-12-03 15:52:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:07,819 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-12-03 15:52:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:52:07,820 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-12-03 15:52:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:07,821 INFO L225 Difference]: With dead ends: 110 [2018-12-03 15:52:07,821 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:52:07,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10549 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22134, Invalid=42636, Unknown=0, NotChecked=0, Total=64770 [2018-12-03 15:52:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:52:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 15:52:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:52:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-03 15:52:07,827 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 104 [2018-12-03 15:52:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:07,827 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-03 15:52:07,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 15:52:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-03 15:52:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:52:07,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:07,828 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-12-03 15:52:07,828 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:07,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2010501796, now seen corresponding path program 51 times [2018-12-03 15:52:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:07,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:07,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:08,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:08,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:08,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:08,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:08,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:08,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:08,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:08,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:08,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:08,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:08,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:52:11,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:11,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:52:11,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:52:11,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:52:11,712 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 54 states. [2018-12-03 15:52:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:11,838 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-12-03 15:52:11,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:52:11,839 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 15:52:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:11,840 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:52:11,840 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:52:11,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:52:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:52:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:52:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:52:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 15:52:11,844 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 106 [2018-12-03 15:52:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:11,845 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 15:52:11,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:52:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 15:52:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:52:11,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:11,845 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1] [2018-12-03 15:52:11,846 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:11,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2010501734, now seen corresponding path program 44 times [2018-12-03 15:52:11,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:11,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:11,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:13,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:13,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:13,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:13,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:13,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:13,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:13,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:13,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:13,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 15:52:13,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:13,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:13,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 100 [2018-12-03 15:52:15,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:15,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:52:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:52:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:15,893 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 55 states. [2018-12-03 15:52:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:15,974 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-12-03 15:52:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:52:15,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-12-03 15:52:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:15,976 INFO L225 Difference]: With dead ends: 112 [2018-12-03 15:52:15,976 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:52:15,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:52:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:52:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:52:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-12-03 15:52:15,981 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 106 [2018-12-03 15:52:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:15,981 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-12-03 15:52:15,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:52:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-12-03 15:52:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:52:15,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:15,982 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-12-03 15:52:15,982 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:15,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash 643108566, now seen corresponding path program 52 times [2018-12-03 15:52:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:15,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:15,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:17,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:17,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:17,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:17,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:17,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:17,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:17,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:17,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:17,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:20,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:20,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 15:52:20,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:20,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:52:20,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:52:20,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:52:20,349 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 55 states. [2018-12-03 15:52:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:20,455 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-03 15:52:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:52:20,455 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 15:52:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:20,456 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:52:20,456 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:52:20,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:52:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:52:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 15:52:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 15:52:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 15:52:20,461 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 108 [2018-12-03 15:52:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:20,461 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 15:52:20,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:52:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 15:52:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:52:20,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:20,462 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1] [2018-12-03 15:52:20,462 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:20,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:20,462 INFO L82 PathProgramCache]: Analyzing trace with hash 643108628, now seen corresponding path program 45 times [2018-12-03 15:52:20,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:20,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:21,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:21,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:21,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:21,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:21,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:21,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:21,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:21,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:21,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:21,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:21,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:24,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 100 [2018-12-03 15:52:24,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:24,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:52:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:52:24,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:24,735 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 56 states. [2018-12-03 15:52:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:24,860 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-12-03 15:52:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:52:24,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-12-03 15:52:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:24,861 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:52:24,862 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:52:24,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:52:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 15:52:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:52:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-12-03 15:52:24,866 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 108 [2018-12-03 15:52:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:24,866 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-12-03 15:52:24,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:52:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-12-03 15:52:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:52:24,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:24,867 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-12-03 15:52:24,867 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:24,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:24,868 INFO L82 PathProgramCache]: Analyzing trace with hash -447907376, now seen corresponding path program 53 times [2018-12-03 15:52:24,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:24,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:24,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:25,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:25,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:25,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:25,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:25,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:25,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:25,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:25,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:26,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 15:52:26,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:26,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:26,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:29,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:29,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:52:29,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:29,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:52:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:52:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:52:29,461 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 56 states. [2018-12-03 15:52:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:29,556 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-12-03 15:52:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:52:29,556 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 15:52:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:29,557 INFO L225 Difference]: With dead ends: 115 [2018-12-03 15:52:29,557 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:52:29,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:52:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:52:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:52:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:52:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 15:52:29,562 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 110 [2018-12-03 15:52:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:29,562 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 15:52:29,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:52:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 15:52:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:52:29,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:29,563 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1] [2018-12-03 15:52:29,563 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:29,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash -447907314, now seen corresponding path program 46 times [2018-12-03 15:52:29,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:29,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:29,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:30,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:30,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:30,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:30,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:30,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:30,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:30,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:30,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:30,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:33,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:33,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 100 [2018-12-03 15:52:33,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:33,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:52:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:52:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:33,987 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 57 states. [2018-12-03 15:52:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:34,114 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-03 15:52:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:52:34,114 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-12-03 15:52:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:34,115 INFO L225 Difference]: With dead ends: 116 [2018-12-03 15:52:34,115 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:52:34,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 163 SyntacticMatches, 10 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:52:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 15:52:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 15:52:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-12-03 15:52:34,120 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 110 [2018-12-03 15:52:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:34,120 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-12-03 15:52:34,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:52:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-12-03 15:52:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 15:52:34,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:34,122 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-12-03 15:52:34,122 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:34,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash -942207414, now seen corresponding path program 54 times [2018-12-03 15:52:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:34,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:34,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 55 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:35,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:35,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:35,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:35,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:35,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:35,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:35,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:35,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:35,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:35,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:35,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 55 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:35,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 55 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:39,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:39,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 15:52:39,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:39,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:52:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:52:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:52:39,072 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 57 states. [2018-12-03 15:52:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:39,207 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-12-03 15:52:39,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:52:39,208 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 15:52:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:39,209 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:52:39,209 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:52:39,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:52:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:52:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 15:52:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:52:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-12-03 15:52:39,214 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 112 [2018-12-03 15:52:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:39,214 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-12-03 15:52:39,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:52:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-12-03 15:52:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 15:52:39,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:39,215 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1] [2018-12-03 15:52:39,215 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:39,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash -942207352, now seen corresponding path program 47 times [2018-12-03 15:52:39,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:39,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:39,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:39,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:39,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:40,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:40,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:40,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:40,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:40,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:40,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:40,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:40,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:40,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:52:40,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:40,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:40,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:43,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:43,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 100 [2018-12-03 15:52:43,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:43,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:52:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:52:43,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:43,579 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 58 states. [2018-12-03 15:52:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:43,674 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-12-03 15:52:43,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:52:43,674 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-12-03 15:52:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:43,675 INFO L225 Difference]: With dead ends: 118 [2018-12-03 15:52:43,675 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:52:43,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 166 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:52:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:52:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:52:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-03 15:52:43,681 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 112 [2018-12-03 15:52:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:43,681 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-03 15:52:43,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:52:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-03 15:52:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:52:43,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:43,682 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-12-03 15:52:43,683 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:43,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 776825924, now seen corresponding path program 55 times [2018-12-03 15:52:43,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:43,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:43,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 56 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:44,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:44,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:44,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:44,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:44,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:44,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:44,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:44,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:44,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 56 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:44,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 56 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:48,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:48,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:52:48,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:48,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:52:48,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:52:48,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:52:48,525 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 58 states. [2018-12-03 15:52:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:48,665 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-03 15:52:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:52:48,665 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 15:52:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:48,666 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:52:48,666 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:52:48,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:52:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:52:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 15:52:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:52:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 15:52:48,671 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 114 [2018-12-03 15:52:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:48,671 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 15:52:48,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:52:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 15:52:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:52:48,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:48,672 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1] [2018-12-03 15:52:48,672 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:48,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash 776825986, now seen corresponding path program 48 times [2018-12-03 15:52:48,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:48,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:48,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:48,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:49,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:49,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:49,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:49,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:49,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:49,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:49,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:49,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:49,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:49,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:49,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:52,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:52,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 100 [2018-12-03 15:52:52,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:52,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:52:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:52:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:52,737 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 59 states. [2018-12-03 15:52:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:52,875 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-12-03 15:52:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:52:52,876 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-12-03 15:52:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:52,876 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:52:52,876 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:52:52,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:52:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:52:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 15:52:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:52:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-12-03 15:52:52,880 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 114 [2018-12-03 15:52:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:52,880 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-12-03 15:52:52,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:52:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-12-03 15:52:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:52:52,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:52,881 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-12-03 15:52:52,881 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:52,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash -794545218, now seen corresponding path program 56 times [2018-12-03 15:52:52,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:52,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:52,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:52,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 57 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:54,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:54,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:54,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:54,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:54,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:54,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:54,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:54,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 15:52:54,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:54,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2018-12-03 15:53:01,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-12-03 15:53:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-12-03 15:53:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6861, Invalid=18261, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 15:53:01,234 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 117 states. [2018-12-03 15:53:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:07,467 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-12-03 15:53:07,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 15:53:07,468 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-12-03 15:53:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:07,469 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:53:07,469 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 15:53:07,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 115 SyntacticMatches, 16 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13729 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=24987, Invalid=49269, Unknown=0, NotChecked=0, Total=74256 [2018-12-03 15:53:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 15:53:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 15:53:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 15:53:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-03 15:53:07,474 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 116 [2018-12-03 15:53:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:07,474 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-03 15:53:07,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-12-03 15:53:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-03 15:53:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 15:53:07,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:07,475 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-12-03 15:53:07,475 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:07,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash 946275512, now seen corresponding path program 57 times [2018-12-03 15:53:07,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 58 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:09,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:09,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:09,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:09,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:09,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:09,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:09,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:09,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 58 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 58 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:12,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:53:12,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:12,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:53:12,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:53:12,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:53:12,720 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 60 states. [2018-12-03 15:53:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:12,881 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-03 15:53:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:53:12,881 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 15:53:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:12,882 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:53:12,882 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 15:53:12,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:53:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 15:53:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 15:53:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:53:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 15:53:12,885 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 118 [2018-12-03 15:53:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:12,885 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 15:53:12,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:53:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 15:53:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 15:53:12,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:12,886 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1] [2018-12-03 15:53:12,886 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:12,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 946275574, now seen corresponding path program 49 times [2018-12-03 15:53:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:14,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:14,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:14,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:14,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:14,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:14,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:14,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:14,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:17,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:17,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 100 [2018-12-03 15:53:17,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:17,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:53:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:53:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:17,566 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 61 states. [2018-12-03 15:53:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:17,647 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-12-03 15:53:17,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:53:17,647 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-12-03 15:53:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:17,648 INFO L225 Difference]: With dead ends: 124 [2018-12-03 15:53:17,648 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:53:17,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 175 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:53:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 15:53:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 15:53:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-12-03 15:53:17,653 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 118 [2018-12-03 15:53:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:17,654 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-12-03 15:53:17,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:53:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-12-03 15:53:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:53:17,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:17,655 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-12-03 15:53:17,655 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:17,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1162248398, now seen corresponding path program 58 times [2018-12-03 15:53:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:17,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:17,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 59 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:19,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:19,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:19,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:19,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 59 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 59 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:22,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 15:53:22,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:22,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:53:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:53:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:53:22,958 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 61 states. [2018-12-03 15:53:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:23,059 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-12-03 15:53:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:53:23,059 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 15:53:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:23,060 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:53:23,060 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:53:23,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:53:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:53:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 15:53:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:53:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 15:53:23,066 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 120 [2018-12-03 15:53:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:23,066 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 15:53:23,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:53:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 15:53:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:53:23,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:23,067 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1] [2018-12-03 15:53:23,067 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:23,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1162248336, now seen corresponding path program 50 times [2018-12-03 15:53:23,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:24,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:24,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:24,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:24,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:24,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:24,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 15:53:24,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:24,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:27,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 100 [2018-12-03 15:53:27,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:27,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:53:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:53:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:27,728 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 62 states. [2018-12-03 15:53:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:27,854 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-12-03 15:53:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:53:27,855 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-12-03 15:53:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:27,855 INFO L225 Difference]: With dead ends: 126 [2018-12-03 15:53:27,856 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:53:27,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:53:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 15:53:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:53:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-12-03 15:53:27,860 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 120 [2018-12-03 15:53:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:27,860 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-12-03 15:53:27,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:53:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-12-03 15:53:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:53:27,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:27,861 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-12-03 15:53:27,861 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:27,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -229162196, now seen corresponding path program 59 times [2018-12-03 15:53:27,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:27,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:27,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 60 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:29,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:29,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:29,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:29,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:29,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 15:53:29,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:29,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 60 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 60 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:53:33,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:53:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:53:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:53:33,312 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 62 states. [2018-12-03 15:53:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:33,439 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-12-03 15:53:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:53:33,439 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 15:53:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:33,440 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:53:33,440 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:53:33,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:53:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:53:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:53:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:53:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-12-03 15:53:33,446 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 122 [2018-12-03 15:53:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:33,446 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-12-03 15:53:33,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:53:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-12-03 15:53:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:53:33,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:33,447 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1] [2018-12-03 15:53:33,447 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:33,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash -229162134, now seen corresponding path program 51 times [2018-12-03 15:53:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:35,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:35,138 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:35,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:35,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:35,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:35,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:35,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:35,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:35,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:38,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 100 [2018-12-03 15:53:38,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:38,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:53:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:53:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:38,317 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 63 states. [2018-12-03 15:53:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:38,457 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-12-03 15:53:38,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:53:38,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-12-03 15:53:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:38,458 INFO L225 Difference]: With dead ends: 128 [2018-12-03 15:53:38,458 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 15:53:38,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 15:53:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 15:53:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 15:53:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-12-03 15:53:38,462 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 122 [2018-12-03 15:53:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:38,462 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-12-03 15:53:38,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:53:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-12-03 15:53:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 15:53:38,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:38,463 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-12-03 15:53:38,463 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:38,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1181486938, now seen corresponding path program 60 times [2018-12-03 15:53:38,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:38,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:38,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 61 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:40,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:40,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:40,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:40,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:40,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:40,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:40,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 61 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 61 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:44,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 15:53:44,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:44,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:53:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:53:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:53:44,399 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 63 states. [2018-12-03 15:53:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:44,579 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-12-03 15:53:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:53:44,579 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 15:53:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:44,580 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:53:44,580 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 15:53:44,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:53:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 15:53:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 15:53:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:53:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 15:53:44,583 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 124 [2018-12-03 15:53:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:44,583 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 15:53:44,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:53:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 15:53:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 15:53:44,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:44,584 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1] [2018-12-03 15:53:44,584 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:44,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1181486876, now seen corresponding path program 52 times [2018-12-03 15:53:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:45,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:45,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:45,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:45,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:46,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:46,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:49,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:49,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 100 [2018-12-03 15:53:49,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:49,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:53:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:53:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:49,045 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 64 states. [2018-12-03 15:53:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:49,171 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-12-03 15:53:49,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:53:49,172 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-12-03 15:53:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:49,172 INFO L225 Difference]: With dead ends: 130 [2018-12-03 15:53:49,173 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:53:49,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:53:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:53:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 15:53:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 15:53:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-12-03 15:53:49,177 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 124 [2018-12-03 15:53:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:49,177 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-12-03 15:53:49,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:53:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-12-03 15:53:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:53:49,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:49,178 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-12-03 15:53:49,178 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:49,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:49,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1537529952, now seen corresponding path program 61 times [2018-12-03 15:53:49,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:49,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:49,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 62 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:50,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:50,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:50,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:50,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:50,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:50,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:50,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 62 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 62 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:55,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:55,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:53:55,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:55,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:53:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:53:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:53:55,247 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 64 states. [2018-12-03 15:53:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:55,344 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-12-03 15:53:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:53:55,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 15:53:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:55,345 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:53:55,345 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 15:53:55,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:53:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 15:53:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 15:53:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:53:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-12-03 15:53:55,348 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 126 [2018-12-03 15:53:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:55,348 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-12-03 15:53:55,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:53:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-12-03 15:53:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:53:55,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:55,349 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1] [2018-12-03 15:53:55,349 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:55,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1537529890, now seen corresponding path program 53 times [2018-12-03 15:53:55,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:55,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:56,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:56,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:56,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:56,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:56,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 15:53:56,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:56,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 100 [2018-12-03 15:54:00,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:00,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:54:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:54:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:00,206 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 65 states. [2018-12-03 15:54:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:00,302 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-12-03 15:54:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:54:00,302 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-12-03 15:54:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:00,303 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:54:00,303 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 15:54:00,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 187 SyntacticMatches, 26 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 15:54:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 15:54:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:54:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-03 15:54:00,309 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 126 [2018-12-03 15:54:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:00,310 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-03 15:54:00,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:54:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-03 15:54:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:54:00,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:00,311 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-12-03 15:54:00,311 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:00,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -97482726, now seen corresponding path program 62 times [2018-12-03 15:54:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:00,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:00,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:01,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:01,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:01,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:01,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:01,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:01,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:01,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 15:54:01,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:01,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:06,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 15:54:06,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:06,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:54:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:54:06,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:54:06,291 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 65 states. [2018-12-03 15:54:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:06,427 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-12-03 15:54:06,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:54:06,428 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 15:54:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:06,429 INFO L225 Difference]: With dead ends: 133 [2018-12-03 15:54:06,429 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:54:06,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:54:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:54:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:54:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:54:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 15:54:06,434 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 128 [2018-12-03 15:54:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:06,434 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 15:54:06,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:54:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 15:54:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:54:06,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:06,434 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1] [2018-12-03 15:54:06,435 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:06,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -97482664, now seen corresponding path program 54 times [2018-12-03 15:54:06,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:08,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:08,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:08,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:08,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:08,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:08,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:08,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:08,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:11,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 100 [2018-12-03 15:54:11,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:11,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:54:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:54:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:11,422 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 66 states. [2018-12-03 15:54:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:11,566 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-12-03 15:54:11,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:54:11,566 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-12-03 15:54:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:11,567 INFO L225 Difference]: With dead ends: 134 [2018-12-03 15:54:11,567 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 15:54:11,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 190 SyntacticMatches, 28 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 15:54:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 15:54:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 15:54:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-12-03 15:54:11,572 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 128 [2018-12-03 15:54:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:11,572 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-12-03 15:54:11,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:54:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-12-03 15:54:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 15:54:11,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:11,573 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-12-03 15:54:11,573 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:11,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 808432148, now seen corresponding path program 63 times [2018-12-03 15:54:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:11,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:11,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:13,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:13,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:13,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:13,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:13,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:13,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:13,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:13,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:13,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:54:17,641 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:17,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:54:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:54:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:54:17,643 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 66 states. [2018-12-03 15:54:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:17,803 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-12-03 15:54:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:54:17,803 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 15:54:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:17,804 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:54:17,804 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 15:54:17,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:54:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 15:54:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 15:54:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:54:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-12-03 15:54:17,809 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 130 [2018-12-03 15:54:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:17,809 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-12-03 15:54:17,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:54:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-12-03 15:54:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 15:54:17,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:17,810 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1] [2018-12-03 15:54:17,810 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:17,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash 808432210, now seen corresponding path program 55 times [2018-12-03 15:54:17,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:17,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:17,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:19,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:19,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:19,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:19,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:19,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:19,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:19,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:19,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:22,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:22,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 100 [2018-12-03 15:54:22,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:22,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:54:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:54:22,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:22,769 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 67 states. [2018-12-03 15:54:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:22,937 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-12-03 15:54:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:54:22,938 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-12-03 15:54:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:22,939 INFO L225 Difference]: With dead ends: 136 [2018-12-03 15:54:22,939 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:54:22,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 193 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:54:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 15:54:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:54:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-03 15:54:22,944 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 130 [2018-12-03 15:54:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:22,944 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-03 15:54:22,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:54:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-03 15:54:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:54:22,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:22,944 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-12-03 15:54:22,945 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:22,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash -485735026, now seen corresponding path program 64 times [2018-12-03 15:54:22,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:22,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:22,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 65 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:24,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:24,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:24,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:24,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:24,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:24,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:24,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:24,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:24,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 65 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:24,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 65 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:29,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 15:54:29,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:29,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:54:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:54:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:54:29,178 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 67 states. [2018-12-03 15:54:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:29,327 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-12-03 15:54:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:54:29,328 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 15:54:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:29,328 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:54:29,328 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 15:54:29,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:54:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 15:54:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 15:54:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 15:54:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-12-03 15:54:29,332 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 132 [2018-12-03 15:54:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:29,332 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-12-03 15:54:29,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:54:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-12-03 15:54:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:54:29,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:29,332 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1] [2018-12-03 15:54:29,333 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:29,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:29,333 INFO L82 PathProgramCache]: Analyzing trace with hash -485734964, now seen corresponding path program 56 times [2018-12-03 15:54:29,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:29,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:29,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:29,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:31,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:31,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:31,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:31,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:31,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:31,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:31,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:31,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 15:54:31,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:31,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:31,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:34,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 100 [2018-12-03 15:54:34,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:34,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:54:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:54:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:34,317 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 68 states. [2018-12-03 15:54:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:34,409 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-12-03 15:54:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:54:34,410 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-12-03 15:54:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:34,410 INFO L225 Difference]: With dead ends: 138 [2018-12-03 15:54:34,411 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:54:34,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 196 SyntacticMatches, 32 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:54:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 15:54:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:54:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-12-03 15:54:34,414 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 132 [2018-12-03 15:54:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:34,414 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-12-03 15:54:34,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:54:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-12-03 15:54:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:54:34,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:34,415 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-12-03 15:54:34,415 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:34,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1360126600, now seen corresponding path program 65 times [2018-12-03 15:54:34,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:34,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:34,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 66 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:36,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:36,233 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:36,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:36,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:36,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:36,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:36,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:36,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 15:54:36,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:36,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 66 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 66 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:41,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:54:41,131 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:41,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:54:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:54:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:54:41,133 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 68 states. [2018-12-03 15:54:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:41,243 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-03 15:54:41,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:54:41,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 15:54:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:41,244 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:54:41,244 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:54:41,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:54:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:54:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 15:54:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:54:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 15:54:41,248 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 134 [2018-12-03 15:54:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:41,248 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 15:54:41,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:54:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 15:54:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:54:41,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:41,249 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1] [2018-12-03 15:54:41,249 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:41,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1360126662, now seen corresponding path program 57 times [2018-12-03 15:54:41,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:41,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:41,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:42,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:42,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:42,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:42,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:42,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:42,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:42,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:42,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:42,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:42,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:42,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:43,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:46,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:46,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2018-12-03 15:54:46,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:46,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:54:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:54:46,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:46,498 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 69 states. [2018-12-03 15:54:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:46,654 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-12-03 15:54:46,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:54:46,654 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-12-03 15:54:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:46,655 INFO L225 Difference]: With dead ends: 140 [2018-12-03 15:54:46,655 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 15:54:46,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 199 SyntacticMatches, 34 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 15:54:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 15:54:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 15:54:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-12-03 15:54:46,659 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 134 [2018-12-03 15:54:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:46,660 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-12-03 15:54:46,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:54:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-12-03 15:54:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 15:54:46,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:46,661 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-12-03 15:54:46,661 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:46,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:46,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1411655938, now seen corresponding path program 66 times [2018-12-03 15:54:46,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:46,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:46,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:46,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:46,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 67 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:48,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:48,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:48,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:48,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:48,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:48,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:48,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:48,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:48,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:48,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:48,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 67 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:48,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 67 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:53,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:53,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 15:54:53,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:53,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:54:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:54:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:54:53,360 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 69 states. [2018-12-03 15:54:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:53,475 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-12-03 15:54:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:54:53,476 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 15:54:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:53,476 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:54:53,476 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 15:54:53,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:54:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 15:54:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 15:54:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:54:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-12-03 15:54:53,482 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 136 [2018-12-03 15:54:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:53,482 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-12-03 15:54:53,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:54:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-12-03 15:54:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 15:54:53,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:53,483 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1] [2018-12-03 15:54:53,483 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:53,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1411656000, now seen corresponding path program 58 times [2018-12-03 15:54:53,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:53,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:53,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:55,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:55,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:55,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:55,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:55,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:55,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:55,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:55,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:55,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:55,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:58,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:58,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 100 [2018-12-03 15:54:58,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:58,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:54:58,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:54:58,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:58,745 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 70 states. [2018-12-03 15:54:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:58,911 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2018-12-03 15:54:58,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:54:58,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-12-03 15:54:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:58,912 INFO L225 Difference]: With dead ends: 142 [2018-12-03 15:54:58,912 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:54:58,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 202 SyntacticMatches, 36 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:54:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:54:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:54:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:54:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-12-03 15:54:58,916 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 136 [2018-12-03 15:54:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:58,916 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-12-03 15:54:58,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:54:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-12-03 15:54:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:54:58,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:58,917 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-12-03 15:54:58,917 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:58,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash -608257796, now seen corresponding path program 67 times [2018-12-03 15:54:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:58,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 68 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:00,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:00,590 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:00,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:00,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:00,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:00,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 68 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:00,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 68 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:05,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:05,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:55:05,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:05,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:55:05,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:55:05,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:55:05,707 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 70 states. [2018-12-03 15:55:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:05,810 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-12-03 15:55:05,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:55:05,811 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 15:55:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:05,811 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:55:05,811 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 15:55:05,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:55:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 15:55:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 15:55:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 15:55:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 15:55:05,816 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 138 [2018-12-03 15:55:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:05,817 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 15:55:05,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:55:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 15:55:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:55:05,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:05,817 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1] [2018-12-03 15:55:05,818 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:05,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash -608257734, now seen corresponding path program 59 times [2018-12-03 15:55:05,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:05,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:07,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:07,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:07,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:07,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:07,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:07,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:07,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:07,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:07,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 15:55:07,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:07,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:07,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:11,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:11,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 100 [2018-12-03 15:55:11,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:11,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:55:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:55:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:55:11,177 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 71 states. [2018-12-03 15:55:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:11,371 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-12-03 15:55:11,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:55:11,372 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-12-03 15:55:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:11,372 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:55:11,372 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 15:55:11,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 205 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:55:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 15:55:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 15:55:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:55:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-12-03 15:55:11,376 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 138 [2018-12-03 15:55:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:11,377 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-12-03 15:55:11,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:55:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-12-03 15:55:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:55:11,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:11,378 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-12-03 15:55:11,378 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:11,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash -420138378, now seen corresponding path program 68 times [2018-12-03 15:55:11,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:11,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:11,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:11,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:11,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 69 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:13,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:13,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:13,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:13,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:13,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:13,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 15:55:13,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:13,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:17,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:22,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:22,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2018-12-03 15:55:22,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:22,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-12-03 15:55:22,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-12-03 15:55:22,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7635, Invalid=21435, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 15:55:22,218 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 141 states. [2018-12-03 15:55:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:31,070 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2018-12-03 15:55:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-12-03 15:55:31,070 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-12-03 15:55:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:31,071 INFO L225 Difference]: With dead ends: 146 [2018-12-03 15:55:31,071 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 15:55:31,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 139 SyntacticMatches, 40 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20953 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=31233, Invalid=63939, Unknown=0, NotChecked=0, Total=95172 [2018-12-03 15:55:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 15:55:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 15:55:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 15:55:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-03 15:55:31,077 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 140 [2018-12-03 15:55:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:31,078 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-03 15:55:31,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-12-03 15:55:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-03 15:55:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 15:55:31,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:31,079 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-12-03 15:55:31,079 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:31,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash -26004112, now seen corresponding path program 69 times [2018-12-03 15:55:31,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:31,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:31,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 70 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:33,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:33,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:33,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:33,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:33,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:33,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:33,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:33,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:33,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 70 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 70 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:38,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:38,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:55:38,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:38,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:55:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:55:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:55:38,686 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 72 states. [2018-12-03 15:55:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:38,871 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-12-03 15:55:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:55:38,872 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 15:55:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:38,872 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:55:38,872 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 15:55:38,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:55:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 15:55:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 15:55:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 15:55:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-12-03 15:55:38,876 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 142 [2018-12-03 15:55:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:38,877 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-12-03 15:55:38,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:55:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-12-03 15:55:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 15:55:38,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:38,877 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1] [2018-12-03 15:55:38,877 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:38,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash -26004050, now seen corresponding path program 60 times [2018-12-03 15:55:38,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:38,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:38,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:40,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:40,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:40,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:40,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:40,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:40,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:40,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:40,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:40,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:40,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:40,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:44,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:44,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 100 [2018-12-03 15:55:44,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:44,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:55:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:55:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:55:44,269 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 73 states. [2018-12-03 15:55:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:44,479 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-12-03 15:55:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:55:44,480 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-12-03 15:55:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:44,480 INFO L225 Difference]: With dead ends: 148 [2018-12-03 15:55:44,480 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:55:44,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 211 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:55:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:55:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 15:55:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 15:55:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-12-03 15:55:44,484 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 142 [2018-12-03 15:55:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:44,484 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-12-03 15:55:44,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:55:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-12-03 15:55:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:55:44,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:44,485 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-12-03 15:55:44,486 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:44,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash 779903466, now seen corresponding path program 70 times [2018-12-03 15:55:44,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:44,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:44,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:44,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:44,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 71 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:46,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:46,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:46,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:46,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:46,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:46,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:46,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:46,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:46,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 71 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:46,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 71 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:52,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:52,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 15:55:52,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:52,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:55:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:55:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:55:52,184 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 73 states. [2018-12-03 15:55:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:52,397 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-12-03 15:55:52,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:55:52,398 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 15:55:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:52,398 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:55:52,398 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 15:55:52,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:55:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 15:55:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 15:55:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 15:55:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 15:55:52,402 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 144 [2018-12-03 15:55:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:52,402 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 15:55:52,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:55:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 15:55:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:55:52,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:52,403 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1] [2018-12-03 15:55:52,403 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:52,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash 779903528, now seen corresponding path program 61 times [2018-12-03 15:55:52,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:52,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:52,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:52,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:54,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:54,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:54,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:54,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:54,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:54,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:54,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:54,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:54,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:54,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 100 [2018-12-03 15:55:58,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:58,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:55:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:55:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:55:58,062 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 74 states. [2018-12-03 15:55:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:58,193 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-12-03 15:55:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:55:58,193 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-12-03 15:55:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:58,194 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:55:58,194 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:55:58,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 214 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:55:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:55:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 15:55:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:55:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-03 15:55:58,199 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 144 [2018-12-03 15:55:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:58,199 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-03 15:55:58,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:55:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-03 15:55:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:55:58,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:58,200 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-12-03 15:55:58,200 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:58,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2131994652, now seen corresponding path program 71 times [2018-12-03 15:55:58,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:58,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 72 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:00,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:00,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:00,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:00,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:00,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 15:56:00,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:00,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 72 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 72 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 15:56:05,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:05,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:56:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:56:05,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:56:05,770 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 74 states. [2018-12-03 15:56:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:05,910 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2018-12-03 15:56:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:56:05,910 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 15:56:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:05,911 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:56:05,911 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:56:05,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:56:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:56:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 15:56:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:56:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-12-03 15:56:05,916 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 146 [2018-12-03 15:56:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:05,916 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-12-03 15:56:05,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:56:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-12-03 15:56:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:56:05,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:05,916 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1] [2018-12-03 15:56:05,917 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:05,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2131994590, now seen corresponding path program 62 times [2018-12-03 15:56:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:05,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:08,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:08,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:08,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:08,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:08,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:08,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:08,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:08,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 15:56:08,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:08,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:08,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 100 [2018-12-03 15:56:11,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:11,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:56:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:56:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:56:11,554 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 75 states. [2018-12-03 15:56:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:11,736 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-12-03 15:56:11,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:56:11,736 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-12-03 15:56:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:11,737 INFO L225 Difference]: With dead ends: 152 [2018-12-03 15:56:11,737 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 15:56:11,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 217 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:56:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 15:56:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 15:56:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 15:56:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-12-03 15:56:11,740 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 146 [2018-12-03 15:56:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:11,740 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-12-03 15:56:11,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:56:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-12-03 15:56:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 15:56:11,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:11,741 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-12-03 15:56:11,741 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:11,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -147409058, now seen corresponding path program 72 times [2018-12-03 15:56:11,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:11,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:11,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 73 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:13,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:13,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:13,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:13,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:13,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:13,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:13,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:14,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:14,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:14,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 73 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 73 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:19,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 15:56:19,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:19,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:56:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:56:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:56:19,971 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 75 states. [2018-12-03 15:56:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:20,182 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-12-03 15:56:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:56:20,182 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 15:56:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:20,182 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:56:20,182 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 15:56:20,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:56:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 15:56:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 15:56:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 15:56:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 15:56:20,187 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 148 [2018-12-03 15:56:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:20,188 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 15:56:20,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:56:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 15:56:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 15:56:20,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:20,188 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1] [2018-12-03 15:56:20,189 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:20,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash -147408996, now seen corresponding path program 63 times [2018-12-03 15:56:20,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:22,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:22,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:22,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:22,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:22,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:22,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:22,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:22,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:25,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 100 [2018-12-03 15:56:25,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:25,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:56:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:56:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:56:25,766 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 76 states. [2018-12-03 15:56:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:25,889 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2018-12-03 15:56:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:56:25,889 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-12-03 15:56:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:25,890 INFO L225 Difference]: With dead ends: 154 [2018-12-03 15:56:25,890 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:56:25,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:56:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:56:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 15:56:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:56:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-12-03 15:56:25,893 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 148 [2018-12-03 15:56:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:25,893 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-12-03 15:56:25,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:56:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-12-03 15:56:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:56:25,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:25,894 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-12-03 15:56:25,894 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:25,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 73867352, now seen corresponding path program 73 times [2018-12-03 15:56:25,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 74 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:27,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:27,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:27,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:27,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 74 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 74 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:34,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 15:56:34,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:34,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:56:34,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:56:34,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:56:34,080 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 76 states. [2018-12-03 15:56:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:34,253 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2018-12-03 15:56:34,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:56:34,254 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 15:56:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:34,254 INFO L225 Difference]: With dead ends: 155 [2018-12-03 15:56:34,254 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 15:56:34,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:56:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 15:56:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 15:56:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 15:56:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-12-03 15:56:34,258 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 150 [2018-12-03 15:56:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:34,258 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-12-03 15:56:34,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:56:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-12-03 15:56:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:56:34,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:34,259 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1] [2018-12-03 15:56:34,259 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:34,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 73867414, now seen corresponding path program 64 times [2018-12-03 15:56:34,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:34,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:34,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:36,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:36,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:36,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:36,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:36,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:36,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:36,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:36,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:36,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:36,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:40,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 100 [2018-12-03 15:56:40,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:40,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:56:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:56:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:56:40,072 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 77 states. [2018-12-03 15:56:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:40,216 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-12-03 15:56:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:56:40,217 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-12-03 15:56:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:40,217 INFO L225 Difference]: With dead ends: 156 [2018-12-03 15:56:40,217 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 15:56:40,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:56:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 15:56:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 15:56:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:56:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-12-03 15:56:40,221 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 150 [2018-12-03 15:56:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:40,221 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-12-03 15:56:40,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:56:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2018-12-03 15:56:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:56:40,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:40,222 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-12-03 15:56:40,222 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:40,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2027867438, now seen corresponding path program 74 times [2018-12-03 15:56:40,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:40,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:40,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 75 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:42,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:42,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:42,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:42,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:42,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:42,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:42,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-12-03 15:56:42,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:42,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:52,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:52,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2018-12-03 15:56:52,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:52,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-12-03 15:56:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-12-03 15:56:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8076, Invalid=23076, Unknown=0, NotChecked=0, Total=31152 [2018-12-03 15:56:52,195 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 153 states. [2018-12-03 15:57:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:02,703 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2018-12-03 15:57:02,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-12-03 15:57:02,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-12-03 15:57:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:02,705 INFO L225 Difference]: With dead ends: 158 [2018-12-03 15:57:02,705 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 15:57:02,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 151 SyntacticMatches, 52 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24997 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=34626, Invalid=71976, Unknown=0, NotChecked=0, Total=106602 [2018-12-03 15:57:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 15:57:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 15:57:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 15:57:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-12-03 15:57:02,711 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 152 [2018-12-03 15:57:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:02,711 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-12-03 15:57:02,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-12-03 15:57:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-12-03 15:57:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 15:57:02,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:02,712 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-12-03 15:57:02,712 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:02,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1134595788, now seen corresponding path program 75 times [2018-12-03 15:57:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:02,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:02,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 76 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:05,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:05,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:05,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:05,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:05,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:05,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:05,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:05,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 76 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 76 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 15:57:11,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:11,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:57:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:57:11,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:57:11,528 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 78 states. [2018-12-03 15:57:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:11,706 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2018-12-03 15:57:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:57:11,706 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 15:57:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:11,707 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:57:11,707 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 15:57:11,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:57:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 15:57:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 15:57:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 15:57:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 15:57:11,710 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 154 [2018-12-03 15:57:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:11,710 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 15:57:11,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:57:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 15:57:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 15:57:11,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:11,711 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1] [2018-12-03 15:57:11,711 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:11,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1134595850, now seen corresponding path program 65 times [2018-12-03 15:57:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:11,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:11,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:13,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:13,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:13,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:13,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:13,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:14,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2018-12-03 15:57:14,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:14,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:14,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:17,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 100 [2018-12-03 15:57:17,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:17,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:57:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:57:17,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:17,678 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 79 states. [2018-12-03 15:57:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:17,842 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-12-03 15:57:17,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:57:17,843 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-12-03 15:57:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:17,843 INFO L225 Difference]: With dead ends: 160 [2018-12-03 15:57:17,843 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:57:17,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 229 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:57:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 15:57:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:57:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-03 15:57:17,848 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 154 [2018-12-03 15:57:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:17,848 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-03 15:57:17,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:57:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-03 15:57:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:57:17,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:17,849 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-12-03 15:57:17,849 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:17,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash -575089594, now seen corresponding path program 76 times [2018-12-03 15:57:17,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:17,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:17,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 77 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:20,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:20,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:20,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:20,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:20,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:20,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:20,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:20,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 77 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:20,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 77 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:26,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:26,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 15:57:26,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:26,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:57:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:57:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:57:26,713 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 79 states. [2018-12-03 15:57:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:26,950 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2018-12-03 15:57:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:57:26,950 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 15:57:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:26,951 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:57:26,951 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 15:57:26,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:57:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 15:57:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 15:57:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 15:57:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-12-03 15:57:26,954 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 156 [2018-12-03 15:57:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:26,955 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-12-03 15:57:26,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:57:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-12-03 15:57:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:57:26,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:26,955 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1] [2018-12-03 15:57:26,955 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:26,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash -575089532, now seen corresponding path program 66 times [2018-12-03 15:57:26,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:26,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:26,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:26,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:26,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:29,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:29,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:29,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:29,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:29,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:29,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:29,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:29,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:29,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:29,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:29,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:29,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:32,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 100 [2018-12-03 15:57:32,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:32,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:57:32,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:57:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:32,841 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 80 states. [2018-12-03 15:57:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:33,074 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-12-03 15:57:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:57:33,074 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-12-03 15:57:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:33,074 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:57:33,074 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 15:57:33,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 232 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 15:57:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 15:57:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 15:57:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2018-12-03 15:57:33,079 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 156 [2018-12-03 15:57:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:33,079 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-12-03 15:57:33,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:57:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2018-12-03 15:57:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:57:33,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:33,080 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-12-03 15:57:33,080 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:33,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1389732672, now seen corresponding path program 77 times [2018-12-03 15:57:33,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 78 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:35,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:35,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:35,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:35,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:35,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:35,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 79 check-sat command(s) [2018-12-03 15:57:35,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:35,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 78 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 78 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 15:57:42,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:57:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:57:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:57:42,378 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand 80 states. [2018-12-03 15:57:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:42,628 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2018-12-03 15:57:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:57:42,628 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 15:57:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:42,629 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:57:42,629 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:57:42,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:57:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:57:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 15:57:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:57:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 15:57:42,632 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 158 [2018-12-03 15:57:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:42,633 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 15:57:42,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:57:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 15:57:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:57:42,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:42,633 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1] [2018-12-03 15:57:42,633 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:42,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1389732734, now seen corresponding path program 67 times [2018-12-03 15:57:42,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:42,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:42,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:44,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:44,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:44,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:44,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:44,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:44,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:44,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:44,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:48,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 100 [2018-12-03 15:57:48,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:48,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:57:48,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:57:48,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:48,497 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 81 states. [2018-12-03 15:57:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:48,647 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2018-12-03 15:57:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:57:48,647 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2018-12-03 15:57:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:48,648 INFO L225 Difference]: With dead ends: 164 [2018-12-03 15:57:48,648 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 15:57:48,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 235 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 15:57:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 15:57:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 15:57:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-03 15:57:48,652 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 158 [2018-12-03 15:57:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:48,652 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-03 15:57:48,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:57:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-03 15:57:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 15:57:48,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:48,653 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-12-03 15:57:48,653 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:48,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash -201679942, now seen corresponding path program 78 times [2018-12-03 15:57:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 79 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:51,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:51,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:51,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:51,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:51,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:51,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:51,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:51,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:51,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 79 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 79 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:58,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 15:57:58,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:58,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:57:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:57:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:57:58,082 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 81 states. [2018-12-03 15:57:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:58,258 INFO L93 Difference]: Finished difference Result 165 states and 170 transitions. [2018-12-03 15:57:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:57:58,258 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 15:57:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:58,259 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:57:58,259 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 15:57:58,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:57:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 15:57:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 15:57:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 15:57:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-12-03 15:57:58,264 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 160 [2018-12-03 15:57:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:58,264 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-12-03 15:57:58,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:57:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-12-03 15:57:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 15:57:58,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:58,264 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1] [2018-12-03 15:57:58,265 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:58,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash -201679880, now seen corresponding path program 68 times [2018-12-03 15:57:58,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:58,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:58,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:00,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:00,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:00,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:00,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:00,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:00,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:00,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:00,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:01,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2018-12-03 15:58:01,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:01,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 100 [2018-12-03 15:58:04,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:04,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:58:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:58:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:58:04,447 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 82 states. [2018-12-03 15:58:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:04,705 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2018-12-03 15:58:04,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:58:04,705 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-12-03 15:58:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:04,706 INFO L225 Difference]: With dead ends: 166 [2018-12-03 15:58:04,706 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:58:04,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 238 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:58:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:58:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:58:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:58:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-12-03 15:58:04,709 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 160 [2018-12-03 15:58:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:04,710 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-12-03 15:58:04,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:58:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-12-03 15:58:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:58:04,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:04,711 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-12-03 15:58:04,711 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:04,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -540844620, now seen corresponding path program 79 times [2018-12-03 15:58:04,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:04,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:04,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 80 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:07,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:07,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:07,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:07,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:07,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:07,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:07,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:07,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 80 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 80 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:14,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 15:58:14,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:14,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:58:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:58:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:58:14,161 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 82 states. [2018-12-03 15:58:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:14,430 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-12-03 15:58:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:58:14,431 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-03 15:58:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:14,431 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:58:14,431 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 15:58:14,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:58:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 15:58:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 15:58:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 15:58:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 15:58:14,435 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 162 [2018-12-03 15:58:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:14,435 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 15:58:14,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:58:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 15:58:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:58:14,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:14,436 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1] [2018-12-03 15:58:14,436 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash -540844558, now seen corresponding path program 69 times [2018-12-03 15:58:14,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:14,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:14,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:17,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:17,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:17,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:17,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:17,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:17,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:17,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:17,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:17,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:17,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:17,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:20,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 100 [2018-12-03 15:58:20,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:20,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:58:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:58:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:58:20,660 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 83 states. [2018-12-03 15:58:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:20,854 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2018-12-03 15:58:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:58:20,854 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2018-12-03 15:58:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:20,854 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:58:20,854 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 15:58:20,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:58:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 15:58:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 15:58:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:58:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-12-03 15:58:20,859 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 162 [2018-12-03 15:58:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:20,859 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-12-03 15:58:20,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:58:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-12-03 15:58:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:58:20,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:20,859 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-12-03 15:58:20,860 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:20,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -60585682, now seen corresponding path program 80 times [2018-12-03 15:58:20,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:20,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:20,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:20,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:20,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 81 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:23,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:23,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:23,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:23,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:23,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:23,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-12-03 15:58:23,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:23,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:28,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:34,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:34,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2018-12-03 15:58:34,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:34,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-12-03 15:58:34,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-12-03 15:58:34,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8553, Invalid=24753, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 15:58:34,758 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 165 states. [2018-12-03 15:58:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:47,093 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-12-03 15:58:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-12-03 15:58:47,094 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 164 [2018-12-03 15:58:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:47,094 INFO L225 Difference]: With dead ends: 170 [2018-12-03 15:58:47,094 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 15:58:47,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29329 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=38199, Invalid=80481, Unknown=0, NotChecked=0, Total=118680 [2018-12-03 15:58:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 15:58:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 15:58:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 15:58:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-12-03 15:58:47,101 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 164 [2018-12-03 15:58:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:47,102 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-12-03 15:58:47,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-12-03 15:58:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-12-03 15:58:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 15:58:47,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:47,102 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-12-03 15:58:47,102 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:47,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1906753064, now seen corresponding path program 81 times [2018-12-03 15:58:47,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 82 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:49,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:49,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:49,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:49,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:49,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:49,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:49,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:49,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:49,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:49,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 82 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 82 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:57,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 15:58:57,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:57,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:58:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:58:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:58:57,313 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 84 states. [2018-12-03 15:58:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:57,468 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-12-03 15:58:57,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:58:57,468 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-03 15:58:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:57,469 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:58:57,469 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 15:58:57,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:58:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 15:58:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 15:58:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:58:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-03 15:58:57,474 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 166 [2018-12-03 15:58:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:57,474 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-03 15:58:57,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:58:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-03 15:58:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 15:58:57,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:57,475 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1] [2018-12-03 15:58:57,475 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:57,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1906753126, now seen corresponding path program 70 times [2018-12-03 15:58:57,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:57,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:57,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:57,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:57,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:59,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:59,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:59,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:59,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:59,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:59,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:59,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:00,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:03,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:03,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 100 [2018-12-03 15:59:03,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:03,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:59:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:59:03,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:03,748 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 85 states. [2018-12-03 15:59:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:03,911 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2018-12-03 15:59:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:59:03,911 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2018-12-03 15:59:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:03,912 INFO L225 Difference]: With dead ends: 172 [2018-12-03 15:59:03,912 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:59:03,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 247 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:59:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 15:59:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 15:59:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-12-03 15:59:03,917 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 166 [2018-12-03 15:59:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:03,917 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-12-03 15:59:03,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:59:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-12-03 15:59:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:59:03,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:03,918 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-12-03 15:59:03,918 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:03,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1561289566, now seen corresponding path program 82 times [2018-12-03 15:59:03,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:03,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:03,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:03,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:03,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 83 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:06,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:06,354 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:06,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:06,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:06,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:06,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:06,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:06,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 83 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 83 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 15:59:14,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:14,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:59:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:59:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:59:14,290 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 85 states. [2018-12-03 15:59:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:14,570 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2018-12-03 15:59:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:59:14,570 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-03 15:59:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:14,571 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:59:14,571 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 15:59:14,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:59:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 15:59:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 15:59:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 15:59:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-12-03 15:59:14,575 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 168 [2018-12-03 15:59:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:14,575 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-12-03 15:59:14,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:59:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-12-03 15:59:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:59:14,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:14,576 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1] [2018-12-03 15:59:14,576 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:14,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:14,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1561289504, now seen corresponding path program 71 times [2018-12-03 15:59:14,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:14,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:14,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:14,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:14,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:17,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:17,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:17,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:17,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:17,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:17,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:17,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:17,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:17,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 15:59:17,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:17,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:17,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:21,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:21,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 100 [2018-12-03 15:59:21,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:21,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:59:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:59:21,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:21,222 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 86 states. [2018-12-03 15:59:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:21,498 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2018-12-03 15:59:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:59:21,498 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-12-03 15:59:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:21,498 INFO L225 Difference]: With dead ends: 174 [2018-12-03 15:59:21,499 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:59:21,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 250 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:59:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 15:59:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:59:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-03 15:59:21,504 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 168 [2018-12-03 15:59:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:21,504 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-03 15:59:21,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:59:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-03 15:59:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:59:21,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:21,505 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-12-03 15:59:21,505 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:21,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:21,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1455635300, now seen corresponding path program 83 times [2018-12-03 15:59:21,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:21,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:21,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:21,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 84 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:24,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:24,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:24,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:24,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:24,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:24,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:24,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:24,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2018-12-03 15:59:24,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:24,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 84 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:24,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 84 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:32,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:32,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 15:59:32,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:32,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:59:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:59:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:59:32,121 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 86 states. [2018-12-03 15:59:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:32,353 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2018-12-03 15:59:32,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:59:32,353 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-03 15:59:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:32,353 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:59:32,354 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:59:32,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:59:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:59:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 15:59:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:59:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-12-03 15:59:32,358 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 170 [2018-12-03 15:59:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:32,358 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-12-03 15:59:32,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:59:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-12-03 15:59:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:59:32,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:32,358 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1] [2018-12-03 15:59:32,359 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:32,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1455635238, now seen corresponding path program 72 times [2018-12-03 15:59:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:32,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:32,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:35,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:35,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:35,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:35,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:35,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:35,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:35,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:35,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:39,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 100 [2018-12-03 15:59:39,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:39,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:59:39,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:59:39,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:39,063 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 87 states. [2018-12-03 15:59:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:39,372 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2018-12-03 15:59:39,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:59:39,372 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2018-12-03 15:59:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:39,373 INFO L225 Difference]: With dead ends: 176 [2018-12-03 15:59:39,373 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 15:59:39,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 253 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 15:59:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 15:59:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 15:59:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-12-03 15:59:39,377 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 170 [2018-12-03 15:59:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:39,377 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-12-03 15:59:39,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:59:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-12-03 15:59:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 15:59:39,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:39,378 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-12-03 15:59:39,378 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:39,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1293866518, now seen corresponding path program 84 times [2018-12-03 15:59:39,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:39,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:39,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:39,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:39,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 85 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:41,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:41,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:41,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:41,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:41,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:42,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:42,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:42,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 85 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:42,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 85 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:50,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:50,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 15:59:50,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:50,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:59:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:59:50,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:59:50,110 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 87 states. [2018-12-03 15:59:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:50,398 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2018-12-03 15:59:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:59:50,398 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-03 15:59:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:50,399 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:59:50,399 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 15:59:50,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:59:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 15:59:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 15:59:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 15:59:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-12-03 15:59:50,405 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 172 [2018-12-03 15:59:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:50,405 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-12-03 15:59:50,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:59:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-12-03 15:59:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 15:59:50,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:50,406 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1] [2018-12-03 15:59:50,406 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:50,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1293866580, now seen corresponding path program 73 times [2018-12-03 15:59:50,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:50,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:50,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:53,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:53,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:53,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:53,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:53,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:53,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:53,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:53,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:53,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 100 [2018-12-03 15:59:57,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:57,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:59:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:59:57,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:57,128 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 88 states. [2018-12-03 15:59:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:57,354 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2018-12-03 15:59:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:59:57,355 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-12-03 15:59:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:57,355 INFO L225 Difference]: With dead ends: 178 [2018-12-03 15:59:57,356 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:59:57,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 256 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:59:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:59:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 15:59:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:59:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-03 15:59:57,363 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 172 [2018-12-03 15:59:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:57,363 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-03 15:59:57,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:59:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-03 15:59:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:59:57,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:57,364 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-12-03 15:59:57,364 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:57,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2134740720, now seen corresponding path program 85 times [2018-12-03 15:59:57,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:57,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:57,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:57,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:57,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 86 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:00,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:00,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:00,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:00,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:00,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 86 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 86 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:08,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:08,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:00:08,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:08,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:00:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:00:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:00:08,800 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 88 states. [2018-12-03 16:00:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:09,098 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2018-12-03 16:00:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:00:09,098 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-03 16:00:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:09,099 INFO L225 Difference]: With dead ends: 179 [2018-12-03 16:00:09,099 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 16:00:09,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:00:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 16:00:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 16:00:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 16:00:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-12-03 16:00:09,103 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 174 [2018-12-03 16:00:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:09,103 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-12-03 16:00:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:00:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-12-03 16:00:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:00:09,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:09,104 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1] [2018-12-03 16:00:09,105 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:09,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2134740658, now seen corresponding path program 74 times [2018-12-03 16:00:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:11,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:11,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:11,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:11,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:11,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:11,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:11,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:11,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:12,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 16:00:12,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:12,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:12,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:15,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 100 [2018-12-03 16:00:15,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:15,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:00:15,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:00:15,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:00:15,606 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 89 states. [2018-12-03 16:00:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:15,884 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-12-03 16:00:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:00:15,884 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2018-12-03 16:00:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:15,885 INFO L225 Difference]: With dead ends: 180 [2018-12-03 16:00:15,885 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 16:00:15,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 259 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:00:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 16:00:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-03 16:00:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:00:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-12-03 16:00:15,890 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 174 [2018-12-03 16:00:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:15,890 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-12-03 16:00:15,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:00:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-12-03 16:00:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 16:00:15,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:15,891 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-12-03 16:00:15,891 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:15,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1508586890, now seen corresponding path program 86 times [2018-12-03 16:00:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:15,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:15,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 87 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:18,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:18,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:18,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:18,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:18,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:18,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:18,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:18,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:18,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-12-03 16:00:18,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:18,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:24,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:31,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:31,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2018-12-03 16:00:31,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:31,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-12-03 16:00:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-12-03 16:00:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9066, Invalid=26466, Unknown=0, NotChecked=0, Total=35532 [2018-12-03 16:00:31,049 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 177 states. [2018-12-03 16:00:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:45,149 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-12-03 16:00:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-12-03 16:00:45,150 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 176 [2018-12-03 16:00:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:45,150 INFO L225 Difference]: With dead ends: 182 [2018-12-03 16:00:45,151 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:00:45,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 175 SyntacticMatches, 76 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33949 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=41952, Invalid=89454, Unknown=0, NotChecked=0, Total=131406 [2018-12-03 16:00:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:00:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 16:00:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 16:00:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-12-03 16:00:45,157 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 176 [2018-12-03 16:00:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:45,158 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-12-03 16:00:45,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-12-03 16:00:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2018-12-03 16:00:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 16:00:45,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:45,158 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-12-03 16:00:45,158 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:45,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1946893436, now seen corresponding path program 87 times [2018-12-03 16:00:45,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:45,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:45,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 88 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:47,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:47,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:47,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:47,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:47,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:47,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:47,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:47,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:48,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:48,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:48,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 88 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:48,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 88 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:00:56,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:56,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:00:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:00:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:00:56,738 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 90 states. [2018-12-03 16:00:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:56,930 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2018-12-03 16:00:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:00:56,930 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-03 16:00:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:56,931 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:00:56,931 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 16:00:56,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:00:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 16:00:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 16:00:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 16:00:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-12-03 16:00:56,935 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 178 [2018-12-03 16:00:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:56,935 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-12-03 16:00:56,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:00:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-12-03 16:00:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 16:00:56,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:56,936 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1] [2018-12-03 16:00:56,936 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:56,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1946893374, now seen corresponding path program 75 times [2018-12-03 16:00:56,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:56,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:56,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:00,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:00,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:00,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:00,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:00,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:00,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:00,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:00,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:00,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:00,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:00,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:00,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:03,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 100 [2018-12-03 16:01:03,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:03,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:01:03,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:01:03,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:01:03,621 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 91 states. [2018-12-03 16:01:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:03,789 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2018-12-03 16:01:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:01:03,790 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2018-12-03 16:01:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:03,791 INFO L225 Difference]: With dead ends: 184 [2018-12-03 16:01:03,791 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:01:03,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 265 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:01:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:01:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 16:01:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 16:01:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-12-03 16:01:03,795 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 178 [2018-12-03 16:01:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:03,796 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-12-03 16:01:03,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:01:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-12-03 16:01:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 16:01:03,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:03,796 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-12-03 16:01:03,796 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:03,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1641200382, now seen corresponding path program 88 times [2018-12-03 16:01:03,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:03,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:03,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 89 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:06,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:06,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:06,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:06,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:06,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:06,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:06,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:06,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:06,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 89 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:07,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 89 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:16,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:16,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:01:16,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:16,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:01:16,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:01:16,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:01:16,134 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 91 states. [2018-12-03 16:01:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:16,445 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-12-03 16:01:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:01:16,446 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-03 16:01:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:16,446 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:01:16,446 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 16:01:16,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:01:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 16:01:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 16:01:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 16:01:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-03 16:01:16,451 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 180 [2018-12-03 16:01:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:16,451 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-03 16:01:16,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:01:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-03 16:01:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 16:01:16,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:16,452 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1] [2018-12-03 16:01:16,452 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:16,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1641200444, now seen corresponding path program 76 times [2018-12-03 16:01:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:16,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:16,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:16,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:16,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:19,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:19,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:19,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:19,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:19,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:19,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:19,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:19,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:19,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:19,512 INFO L316 TraceCheckSpWp]: Computing backward predicates...