java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:15:59,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:15:59,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:15:59,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:15:59,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:15:59,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:15:59,059 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:15:59,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:15:59,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:15:59,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:15:59,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:15:59,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:15:59,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:15:59,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:15:59,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:15:59,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:15:59,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:15:59,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:15:59,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:15:59,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:15:59,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:15:59,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:15:59,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:15:59,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:15:59,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:15:59,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:15:59,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:15:59,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:15:59,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:15:59,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:15:59,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:15:59,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:15:59,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:15:59,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:15:59,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:15:59,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:15:59,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:15:59,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:15:59,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:15:59,117 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:15:59,117 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:15:59,117 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:15:59,117 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:15:59,117 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:15:59,118 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:15:59,118 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:15:59,118 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:15:59,118 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:15:59,118 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:15:59,119 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:15:59,120 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:15:59,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:15:59,120 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:15:59,120 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:15:59,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:15:59,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:15:59,122 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:15:59,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:15:59,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:15:59,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:15:59,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:15:59,123 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:15:59,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:15:59,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:15:59,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:15:59,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:15:59,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:15:59,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:15:59,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:15:59,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:15:59,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:15:59,126 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:15:59,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:15:59,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:15:59,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:15:59,127 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:15:59,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:15:59,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:15:59,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:15:59,206 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:15:59,206 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:15:59,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl [2018-12-03 18:15:59,208 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl' [2018-12-03 18:15:59,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:15:59,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:15:59,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:15:59,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:15:59,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:15:59,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,285 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:15:59,286 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:15:59,287 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:15:59,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:15:59,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:15:59,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:15:59,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:15:59,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/1) ... [2018-12-03 18:15:59,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:15:59,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:15:59,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:15:59,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:15:59,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (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 18:15:59,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:15:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:15:59,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:15:59,594 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:15:59,595 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:15:59,596 INFO L202 PluginConnector]: Adding new model LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:15:59 BoogieIcfgContainer [2018-12-03 18:15:59,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:15:59,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:15:59,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:15:59,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:15:59,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:15:59" (1/2) ... [2018-12-03 18:15:59,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f86a79 and model type LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:15:59, skipping insertion in model container [2018-12-03 18:15:59,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:15:59" (2/2) ... [2018-12-03 18:15:59,605 INFO L112 eAbstractionObserver]: Analyzing ICFG LuxembourgOctopus.bpl [2018-12-03 18:15:59,615 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:15:59,625 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:15:59,643 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:15:59,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:15:59,685 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:15:59,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:15:59,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:15:59,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:15:59,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:15:59,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:15:59,687 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:15:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:15:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:15:59,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:15:59,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:15:59,718 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:15:59,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:15:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 18:15:59,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:15:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:15:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:15:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:15:59,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:15:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:15:59,874 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 18:15:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:15:59,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:15:59,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:15:59,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:15:59,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:15:59,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:15:59,895 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:15:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:15:59,949 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 18:15:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:15:59,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:15:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:15:59,962 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:15:59,962 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:15:59,966 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 18:15:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:15:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:16:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:16:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:16:00,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:16:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:00,003 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:16:00,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:16:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:16:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:16:00,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:00,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:16:00,004 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:00,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 18:16:00,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:00,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:00,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:00,159 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 18:16:00,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:00,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:00,160 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:16:00,162 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 18:16:00,225 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:16:00,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:16:00,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:16:00,478 INFO L272 AbstractInterpreter]: Visited 4 different actions 32 times. Merged at 3 different actions 18 times. Widened at 1 different actions 7 times. Found 6 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:16:00,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:00,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:16:00,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:00,497 INFO 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 18:16:00,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:00,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:00,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:00,583 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 18:16:00,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:00,648 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 18:16:00,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:00,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 18:16:00,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:00,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:16:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:16:00,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:16:00,671 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 18:16:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:00,710 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:16:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:16:00,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:16:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:00,711 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:16:00,711 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:16:00,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:16:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:16:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:16:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:16:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:16:00,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:16:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:00,715 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:16:00,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:16:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:16:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:16:00,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:00,716 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:16:00,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:00,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 18:16:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:00,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:00,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:00,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:00,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:00,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:00,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:00,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:16:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:00,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:00,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:16:00,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:00,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:00,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:00,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:00,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 18:16:00,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:00,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:16:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:16:00,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:16:00,960 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 18:16:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:00,989 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:16:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:16:00,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 18:16:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:00,991 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:16:00,991 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:16:00,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:16:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:16:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:16:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:16:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:16:00,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:16:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:00,997 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:16:00,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:16:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:16:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:16:00,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:00,998 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:16:00,999 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:00,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 18:16:00,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:01,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:01,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:01,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:01,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:01,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:01,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:01,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:01,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:16:01,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:01,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:01,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:01,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:01,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:01,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:01,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:01,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 18:16:01,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:01,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:16:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:16:01,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:16:01,517 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 18:16:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:01,537 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:16:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:16:01,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 18:16:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:01,540 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:16:01,541 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:16:01,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:16:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:16:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:16:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:16:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:16:01,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:16:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:01,545 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:16:01,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:16:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:16:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:16:01,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:01,546 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:16:01,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:01,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 18:16:01,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:01,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:01,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:01,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:01,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:01,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:01,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:01,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:01,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:01,740 INFO 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 18:16:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:01,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:01,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:01,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:01,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:01,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 18:16:01,955 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:01,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:16:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:16:01,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:16:01,956 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 18:16:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:01,977 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:16:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:16:01,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 18:16:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:01,980 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:16:01,980 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:16:01,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:16:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:16:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:16:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:16:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:16:01,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:16:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:01,984 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:16:01,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:16:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:16:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:16:01,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:01,985 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:16:01,985 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:01,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 18:16:01,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:01,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:01,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:02,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:02,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:02,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:02,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:02,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:02,375 INFO 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 18:16:02,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:02,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:02,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:16:02,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:02,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:02,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:02,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:02,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 18:16:02,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:02,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:16:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:16:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:16:02,574 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 18:16:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:02,606 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:16:02,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:16:02,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:16:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:02,607 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:16:02,608 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:16:02,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:16:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:16:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:16:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:16:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:16:02,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:16:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:02,611 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:16:02,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:16:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:16:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:16:02,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:02,612 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:16:02,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:02,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 18:16:02,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:02,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:02,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:02,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:02,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:02,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:02,747 INFO 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 18:16:02,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:02,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:02,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:02,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:02,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:02,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:03,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:03,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 18:16:03,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:03,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:16:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:16:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:16:03,019 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 18:16:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:03,046 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:16:03,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:16:03,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 18:16:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:03,048 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:16:03,049 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:16:03,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:16:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:16:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:16:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:16:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:16:03,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:16:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:03,053 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:16:03,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:16:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:16:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:16:03,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:03,054 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:16:03,054 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:03,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 18:16:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:03,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:03,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:03,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:03,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:03,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:03,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:03,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:03,222 INFO 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 18:16:03,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:03,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:03,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:03,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:03,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:03,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 18:16:03,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:03,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:16:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:16:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:16:03,558 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 18:16:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:03,588 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:16:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:16:03,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:16:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:03,593 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:16:03,593 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:16:03,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:16:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:16:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:16:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:16:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:16:03,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:16:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:03,597 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:16:03,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:16:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:16:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:16:03,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:03,598 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 18:16:03,598 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:03,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 18:16:03,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:03,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:03,762 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 18:16:03,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:03,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:03,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:03,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:03,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:03,763 INFO 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 18:16:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:03,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:03,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:16:03,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:03,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:03,907 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 18:16:03,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:04,191 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 18:16:04,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:04,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 18:16:04,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:04,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:16:04,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:16:04,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:16:04,213 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 18:16:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:04,239 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:16:04,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:16:04,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 18:16:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:04,240 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:16:04,240 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:16:04,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:16:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:16:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:16:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:16:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:16:04,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:16:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:04,244 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:16:04,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:16:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:16:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:16:04,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:04,245 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:16:04,245 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:04,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 18:16:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:04,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:04,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:04,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:04,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:04,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:04,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:04,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:04,471 INFO 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 18:16:04,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:04,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:04,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:04,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:04,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:04,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 18:16:04,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:04,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:16:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:16:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:16:04,944 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 18:16:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:04,977 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:16:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:16:04,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 18:16:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:04,978 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:16:04,978 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:16:04,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:16:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:16:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:16:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:16:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:16:04,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 18:16:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:04,982 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:16:04,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:16:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:16:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:16:04,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:04,983 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 18:16:04,983 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:04,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:04,983 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 18:16:04,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:04,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:04,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:04,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:04,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:05,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:05,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:05,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:05,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:05,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:05,184 INFO 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 18:16:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:05,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:05,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:05,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:05,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:05,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 18:16:05,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:05,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:16:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:16:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:16:05,679 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 18:16:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:05,703 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 18:16:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:16:05,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 18:16:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:05,704 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:16:05,704 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:16:05,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:16:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:16:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:16:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:16:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:16:05,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 18:16:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:05,708 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:16:05,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:16:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:16:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:16:05,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:05,709 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 18:16:05,709 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:05,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 18:16:05,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:05,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:05,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:05,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:05,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:05,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:05,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:05,950 INFO 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 18:16:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:05,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:05,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:16:05,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:05,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:06,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 18:16:06,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:06,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:16:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:16:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:16:06,509 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 18:16:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:06,541 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:16:06,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:16:06,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 18:16:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:06,542 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:16:06,542 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:16:06,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:16:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:16:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:16:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:16:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:16:06,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 18:16:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:06,546 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:16:06,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:16:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:16:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:16:06,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:06,547 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 18:16:06,547 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:06,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 18:16:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:06,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:06,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:06,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:06,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:06,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:06,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:06,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:06,786 INFO 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 18:16:06,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:06,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:06,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:06,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:06,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:06,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:07,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:07,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 18:16:07,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:07,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:16:07,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:16:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:16:07,410 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 18:16:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:07,643 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 18:16:07,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:16:07,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 18:16:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:07,648 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:16:07,648 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:16:07,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:16:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:16:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:16:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:16:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:16:07,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 18:16:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:07,652 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:16:07,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:16:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:16:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:16:07,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:07,653 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 18:16:07,653 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:07,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 18:16:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:07,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:07,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:07,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:07,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:07,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:07,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:07,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:07,883 INFO 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 18:16:07,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:07,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:07,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:07,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:08,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:08,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 18:16:08,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:16:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:16:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:16:08,510 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 18:16:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:08,546 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:16:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:16:08,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:16:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:08,548 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:16:08,549 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:16:08,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:16:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:16:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:16:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:16:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:16:08,553 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 18:16:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:08,553 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:16:08,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:16:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:16:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:16:08,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:08,554 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 18:16:08,554 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:08,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 18:16:08,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:08,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:08,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:08,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:08,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:08,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:08,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:08,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:08,817 INFO 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 18:16:08,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:08,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:08,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:16:08,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:08,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:08,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:09,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 18:16:09,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:09,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:16:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:16:09,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:16:09,502 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 18:16:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:09,530 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 18:16:09,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:16:09,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 18:16:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:09,532 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:16:09,532 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:16:09,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:16:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:16:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:16:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:16:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:16:09,537 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 18:16:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:09,538 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:16:09,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:16:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:16:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:16:09,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:09,539 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 18:16:09,539 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:09,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 18:16:09,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:09,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:09,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:09,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:09,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:09,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:09,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:09,998 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:09,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:09,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:09,998 INFO 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 18:16:10,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:10,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:10,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:10,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:10,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:10,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:11,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:11,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 18:16:11,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:11,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:16:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:16:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:16:11,477 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 18:16:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:11,520 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:16:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:16:11,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 18:16:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:11,521 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:16:11,522 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:16:11,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:16:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:16:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:16:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:16:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:16:11,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 18:16:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:11,527 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:16:11,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:16:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:16:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:16:11,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:11,528 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 18:16:11,528 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:11,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:11,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 18:16:11,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:11,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:11,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:11,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:11,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:11,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:11,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:11,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:11,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:11,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:11,811 INFO 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 18:16:11,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:11,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:11,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:11,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:12,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:12,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 18:16:12,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:12,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:16:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:16:12,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:16:12,995 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 18:16:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:13,029 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 18:16:13,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:16:13,030 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 18:16:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:13,030 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:16:13,030 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:16:13,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:16:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:16:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:16:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:16:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:16:13,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 18:16:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:13,034 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:16:13,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:16:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:16:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:16:13,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:13,035 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 18:16:13,035 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:13,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 18:16:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:13,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:13,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:13,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:13,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:13,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:13,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:16:13,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:13,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:13,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:16:13,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:13,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:14,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 18:16:14,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:14,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:16:14,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:16:14,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:16:14,513 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 18:16:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:14,552 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:16:14,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:16:14,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 18:16:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:14,553 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:16:14,553 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:16:14,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:16:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:16:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:16:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:16:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:16:14,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 18:16:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:16:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:16:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:16:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:16:14,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:14,561 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 18:16:14,562 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:14,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 18:16:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:15,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:15,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:15,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:15,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:15,139 INFO 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 18:16:15,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:15,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:15,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:15,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:15,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:15,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 18:16:15,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:15,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:16:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:16:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:16:15,940 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 18:16:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:15,989 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 18:16:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:16:15,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 18:16:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:15,990 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:16:15,990 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:16:15,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:16:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:16:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:16:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:16:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:16:15,994 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 18:16:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:15,994 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:16:15,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:16:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:16:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:16:15,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:15,995 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 18:16:15,995 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:15,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 18:16:15,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:15,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:15,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:16,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:16,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:16,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:16,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:16,377 INFO 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 18:16:16,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:16,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:16,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:17,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 18:16:17,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:17,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:16:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:16:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:16:17,528 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 18:16:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:17,572 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:16:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:16:17,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 18:16:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:17,575 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:16:17,575 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:16:17,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:16:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:16:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:16:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:16:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:16:17,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 18:16:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:17,583 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:16:17,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:16:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:16:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:16:17,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:17,585 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 18:16:17,585 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:17,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 18:16:17,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:17,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:17,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:18,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:18,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:18,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:18,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:18,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:18,007 INFO 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 18:16:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:18,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:18,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 18:16:18,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:18,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:18,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:19,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 18:16:19,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:19,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:16:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:16:19,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 18:16:19,032 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 18:16:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:19,113 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 18:16:19,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:16:19,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 18:16:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:19,114 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:16:19,114 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:16:19,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 18:16:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:16:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:16:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:16:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:16:19,119 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 18:16:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:19,120 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:16:19,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:16:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:16:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:16:19,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:19,120 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 18:16:19,121 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:19,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 18:16:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:19,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:19,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:19,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:19,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:19,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:19,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:19,529 INFO 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 18:16:19,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:19,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:19,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:19,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:19,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:20,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:20,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 18:16:20,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:20,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:16:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:16:20,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 18:16:20,787 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 18:16:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:20,889 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:16:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:16:20,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 18:16:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:20,891 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:16:20,891 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:16:20,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 18:16:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:16:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:16:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:16:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:16:20,896 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 18:16:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:20,896 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:16:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:16:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:16:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:16:20,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:20,897 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 18:16:20,897 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:20,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 18:16:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:20,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:20,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:22,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:22,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:22,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:22,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:22,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:22,011 INFO 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 18:16:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:22,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:22,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:22,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:23,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:23,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 18:16:23,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:23,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:16:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:16:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:16:23,253 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 18:16:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:23,359 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 18:16:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:16:23,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 18:16:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:23,360 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:16:23,360 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:16:23,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:16:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:16:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:16:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:16:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:16:23,364 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 18:16:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:23,364 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:16:23,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:16:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:16:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:16:23,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:23,365 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 18:16:23,365 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:23,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 18:16:23,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:23,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:23,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:23,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:23,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:23,831 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:23,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:23,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:23,831 INFO 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 18:16:23,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:23,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:23,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:16:23,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:23,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:23,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:25,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:25,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 18:16:25,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:25,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:16:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:16:25,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:16:25,434 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 18:16:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:25,645 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:16:25,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:16:25,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 18:16:25,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:25,646 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:16:25,646 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:16:25,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:16:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:16:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:16:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:16:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:16:25,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 18:16:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:25,651 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:16:25,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:16:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:16:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:16:25,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:25,651 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 18:16:25,652 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:25,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 18:16:25,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:25,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:25,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:26,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:26,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:26,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:26,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:26,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:26,164 INFO 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 18:16:26,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:26,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:26,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:26,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:26,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:26,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:27,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 18:16:27,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:27,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:16:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:16:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:16:27,946 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 18:16:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:27,998 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 18:16:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:16:27,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 18:16:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:27,999 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:16:27,999 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:16:28,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:16:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:16:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:16:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:16:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:16:28,003 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 18:16:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:28,004 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:16:28,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:16:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:16:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:16:28,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:28,005 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 18:16:28,005 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:28,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 18:16:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:28,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:28,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:28,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:28,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:28,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:28,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:28,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:28,543 INFO 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 18:16:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:28,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:28,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:28,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:30,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:30,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 18:16:30,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:30,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:16:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:16:30,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:16:30,015 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 18:16:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:30,181 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:16:30,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:16:30,182 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 18:16:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:30,182 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:16:30,182 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:16:30,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:16:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:16:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:16:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:16:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:16:30,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 18:16:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:30,186 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:16:30,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:16:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:16:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:16:30,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:30,186 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 18:16:30,187 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:30,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 18:16:30,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:30,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:30,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:30,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:30,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:30,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:30,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:30,841 INFO 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 18:16:30,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:30,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:30,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:16:30,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:30,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:30,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:32,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 18:16:32,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:32,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:16:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:16:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 18:16:32,601 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 18:16:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:32,658 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 18:16:32,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:16:32,658 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 18:16:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:32,659 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:16:32,659 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:16:32,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 18:16:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:16:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:16:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:16:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:16:32,664 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 18:16:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:32,664 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:16:32,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:16:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:16:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:16:32,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:32,665 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 18:16:32,665 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:32,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:32,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 18:16:32,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:32,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:32,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:32,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:33,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:33,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:33,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:33,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:33,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:33,338 INFO 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 18:16:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:33,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:33,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:33,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:33,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:33,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:35,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 18:16:35,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:35,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:16:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:16:35,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 18:16:35,033 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 18:16:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:35,092 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:16:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:16:35,093 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 18:16:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:35,093 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:16:35,093 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:16:35,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 18:16:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:16:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:16:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:16:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:16:35,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 18:16:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:35,099 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:16:35,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:16:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:16:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:16:35,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:35,099 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 18:16:35,100 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:35,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 18:16:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:35,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:35,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:35,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:35,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:35,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:35,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:35,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:35,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:16:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:35,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:35,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:36,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 18:16:37,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:37,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:16:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:16:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:16:37,682 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 18:16:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:37,749 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 18:16:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:16:37,749 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 18:16:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:37,750 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:16:37,750 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:16:37,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:16:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:16:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:16:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:16:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:16:37,755 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 18:16:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:37,755 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:16:37,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:16:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:16:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:16:37,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:37,756 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 18:16:37,756 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:37,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 18:16:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:37,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:37,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:37,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:37,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:38,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:38,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:38,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:38,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:38,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:38,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 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 18:16:38,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:38,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:38,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:16:38,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:38,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:38,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:40,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:40,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 18:16:40,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:40,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:16:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:16:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 18:16:40,767 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 18:16:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:40,829 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:16:40,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:16:40,830 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 18:16:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:40,831 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:16:40,831 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:16:40,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 18:16:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:16:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:16:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:16:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:16:40,835 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 18:16:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:40,836 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:16:40,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:16:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:16:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:16:40,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:40,836 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 18:16:40,836 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:40,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 18:16:40,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:40,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:40,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:41,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:41,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:41,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:41,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:41,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:41,598 INFO 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 18:16:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:41,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:41,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:41,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:41,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:41,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:43,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:43,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 18:16:43,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:43,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:16:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:16:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 18:16:43,574 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 18:16:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:43,668 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 18:16:43,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:16:43,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 18:16:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:43,669 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:16:43,669 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:16:43,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 18:16:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:16:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:16:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:16:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:16:43,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 18:16:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:43,672 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:16:43,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:16:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:16:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:16:43,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:43,673 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 18:16:43,673 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:43,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 18:16:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:43,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:43,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:44,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:44,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:44,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:44,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:44,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:44,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:16:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:44,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:44,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:44,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:46,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:46,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 18:16:46,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:46,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:16:46,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:16:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:16:46,831 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 18:16:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:46,932 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:16:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:16:46,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 18:16:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:46,933 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:16:46,933 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:16:46,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:16:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:16:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:16:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:16:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:16:46,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 18:16:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:46,938 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:16:46,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:16:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:16:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:16:46,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:46,939 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 18:16:46,939 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:46,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 18:16:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:46,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:46,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:47,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:47,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:47,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:47,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 18:16:47,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:47,862 INFO 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 18:16:47,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:47,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:47,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 18:16:47,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:47,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:47,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:50,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:50,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 68 [2018-12-03 18:16:50,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:50,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:16:50,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:16:50,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 18:16:50,348 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 18:16:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:50,393 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 18:16:50,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:16:50,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 18:16:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:50,394 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:16:50,394 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:16:50,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 18:16:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:16:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:16:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:16:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:16:50,399 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 18:16:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:50,399 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:16:50,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:16:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:16:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:16:50,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:50,400 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 18:16:50,400 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:50,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 18:16:50,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:50,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:50,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:50,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:50,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:51,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:51,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:51,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:51,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:51,444 INFO 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 18:16:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:51,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:51,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:51,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:51,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:53,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:53,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 18:16:53,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:53,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:16:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:16:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:16:53,770 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-12-03 18:16:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:53,835 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:16:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:16:53,835 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-12-03 18:16:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:53,836 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:16:53,836 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:16:53,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:16:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:16:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:16:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:16:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:16:53,840 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 18:16:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:53,840 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:16:53,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:16:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:16:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:16:53,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:53,840 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 18:16:53,841 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:53,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 18:16:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:53,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:53,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:54,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:54,904 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:54,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:54,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:54,905 INFO 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 18:16:54,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:54,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:54,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-12-03 18:16:57,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:57,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:16:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:16:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:16:57,616 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 18:16:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:57,738 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 18:16:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:16:57,739 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 18:16:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:57,740 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:16:57,740 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:16:57,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:16:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:16:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:16:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:16:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:16:57,744 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 18:16:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:57,744 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:16:57,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:16:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:16:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:16:57,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:57,745 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 18:16:57,745 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:57,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 18:16:57,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:57,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:59,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:59,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:59,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:59,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 18:16:59,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:59,044 INFO 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 18:16:59,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:59,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:59,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 18:16:59,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:59,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:59,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 18:17:02,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:02,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:17:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:17:02,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:17:02,043 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-12-03 18:17:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:02,095 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:17:02,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:17:02,096 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-12-03 18:17:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:02,096 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:17:02,096 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:17:02,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:17:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:17:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:17:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:17:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:17:02,100 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 18:17:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:02,100 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:17:02,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:17:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:17:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:17:02,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:02,101 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 18:17:02,101 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:02,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 18:17:02,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:02,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:02,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:02,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:02,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:03,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:03,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:03,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:03,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:03,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:03,089 INFO 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 18:17:03,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:03,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:03,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:03,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:03,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:03,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 76 [2018-12-03 18:17:05,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:05,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:17:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:17:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 18:17:05,871 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 18:17:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:05,959 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 18:17:05,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:17:05,960 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 18:17:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:05,960 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:17:05,960 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:17:05,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 18:17:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:17:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:17:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:17:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:17:05,963 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 18:17:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:05,964 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:17:05,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:17:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:17:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:17:05,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:05,964 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 18:17:05,965 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:05,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 18:17:05,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:05,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:05,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:07,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:07,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:07,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:07,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:07,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:07,162 INFO 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 18:17:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:07,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:07,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:07,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:10,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:10,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 18:17:10,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:10,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:17:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:17:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:17:10,082 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-12-03 18:17:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:10,159 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:17:10,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:17:10,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-03 18:17:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:10,160 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:17:10,160 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:17:10,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:17:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:17:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:17:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:17:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:17:10,163 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 18:17:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:10,164 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:17:10,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:17:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:17:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:17:10,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:10,164 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 18:17:10,165 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:10,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 18:17:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:10,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:10,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:11,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:11,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:11,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:11,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 18:17:11,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:11,877 INFO 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 18:17:11,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:11,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:11,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:17:11,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:11,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:11,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:15,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:15,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2018-12-03 18:17:15,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:15,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:17:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:17:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:17:15,070 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 18:17:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:15,129 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 18:17:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:17:15,129 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 18:17:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:15,130 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:17:15,130 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:17:15,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:17:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:17:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:17:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:17:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:17:15,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 18:17:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:15,134 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:17:15,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:17:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:17:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:17:15,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:15,135 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 18:17:15,135 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:15,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:15,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 18:17:15,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:15,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:15,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:15,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:15,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:16,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:16,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:16,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:16,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:16,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:16,647 INFO 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 18:17:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:16,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:16,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:16,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:16,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:16,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:19,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:19,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 18:17:19,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:19,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:17:19,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:17:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 18:17:19,773 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-12-03 18:17:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:19,882 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:17:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:17:19,882 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-12-03 18:17:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:19,883 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:17:19,883 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:17:19,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 18:17:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:17:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:17:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:17:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:17:19,886 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 18:17:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:19,887 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:17:19,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:17:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:17:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:17:19,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:19,887 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 18:17:19,887 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:19,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 18:17:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:19,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:19,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:21,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:21,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:21,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:21,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:21,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:21,151 INFO 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 18:17:21,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:21,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:21,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:21,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 84 [2018-12-03 18:17:24,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:24,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:17:24,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:17:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:17:24,711 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 18:17:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:24,788 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 18:17:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:17:24,789 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 18:17:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:24,789 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:17:24,790 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:17:24,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:17:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:17:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:17:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:17:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:17:24,793 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 18:17:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:24,793 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:17:24,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:17:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:17:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:17:24,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:24,794 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 18:17:24,794 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:24,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 18:17:24,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:24,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:24,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:26,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:26,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:26,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:26,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:26,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:26,181 INFO 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 18:17:26,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:26,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:26,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:17:26,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:26,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:26,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:29,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:29,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 18:17:29,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:29,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:17:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:17:29,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 18:17:29,858 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-12-03 18:17:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:29,938 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 18:17:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:17:29,939 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 18:17:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:29,939 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:17:29,940 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:17:29,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 18:17:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:17:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:17:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:17:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 18:17:29,943 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 18:17:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:29,943 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 18:17:29,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:17:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 18:17:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:17:29,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:29,944 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 18:17:29,944 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:29,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 18:17:29,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:29,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:29,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:29,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:29,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:31,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:31,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:31,233 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:31,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 18:17:31,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:31,234 INFO 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 18:17:31,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:31,245 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:31,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:31,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:31,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:31,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:35,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:35,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 88 [2018-12-03 18:17:35,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:35,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:17:35,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:17:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 18:17:35,221 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 18:17:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:35,304 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 18:17:35,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:17:35,305 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 18:17:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:35,305 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:17:35,306 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:17:35,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 18:17:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:17:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:17:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:17:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 18:17:35,309 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 18:17:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:35,310 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 18:17:35,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:17:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 18:17:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:17:35,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:35,310 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 18:17:35,311 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:35,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 18:17:35,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:35,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:35,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:37,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:37,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:37,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:37,079 INFO 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 18:17:37,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:37,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:37,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:37,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:40,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:40,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 18:17:40,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:40,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:17:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:17:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:17:40,869 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-12-03 18:17:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:41,014 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 18:17:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:17:41,014 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-12-03 18:17:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:41,015 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:17:41,015 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:17:41,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:17:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:17:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 18:17:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:17:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 18:17:41,019 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 18:17:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:41,019 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 18:17:41,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:17:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 18:17:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:17:41,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:41,020 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 18:17:41,020 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:41,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 18:17:41,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:41,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:41,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:42,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:42,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:42,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:42,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:42,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:42,699 INFO 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 18:17:42,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:42,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:42,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 18:17:42,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:42,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:42,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 92 [2018-12-03 18:17:46,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:46,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:17:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:17:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 18:17:46,695 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 18:17:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:46,782 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 18:17:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:17:46,782 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 18:17:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:46,783 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:17:46,783 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:17:46,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 18:17:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:17:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 18:17:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:17:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 18:17:46,788 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 18:17:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:46,788 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 18:17:46,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:17:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 18:17:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 18:17:46,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:46,789 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 18:17:46,789 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:46,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 18:17:46,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:46,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:46,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:48,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:48,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:48,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:48,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:48,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:48,468 INFO 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 18:17:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:48,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:48,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:48,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:48,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:48,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:52,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 18:17:52,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:52,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:17:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:17:52,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 18:17:52,891 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-12-03 18:17:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:53,237 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 18:17:53,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:17:53,238 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-03 18:17:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:53,238 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:17:53,238 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:17:53,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 18:17:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:17:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:17:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:17:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 18:17:53,242 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 18:17:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:53,243 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 18:17:53,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:17:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 18:17:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:17:53,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:53,243 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 18:17:53,244 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:53,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 18:17:53,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:53,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:53,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:54,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:54,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:54,920 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:54,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:54,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:54,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 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 18:17:54,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:54,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:54,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:54,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:59,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:59,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-12-03 18:17:59,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:59,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:17:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:17:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 18:17:59,513 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 18:17:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:59,607 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 18:17:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:17:59,607 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 18:17:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:59,608 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:17:59,608 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:17:59,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 18:17:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:17:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:17:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:17:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:17:59,611 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 18:17:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:59,611 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:17:59,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:17:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:17:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:17:59,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:59,612 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 18:17:59,612 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:59,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 18:17:59,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:59,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:59,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:59,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:59,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:01,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:01,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:01,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:01,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:01,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:01,171 INFO 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 18:18:01,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:01,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:01,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 18:18:01,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:01,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:01,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:06,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:06,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 18:18:06,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:06,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:18:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:18:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 18:18:06,212 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-12-03 18:18:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:06,310 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 18:18:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:18:06,313 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-12-03 18:18:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:06,314 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:18:06,314 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:18:06,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 18:18:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:18:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:18:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:18:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 18:18:06,320 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 18:18:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:06,321 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 18:18:06,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:18:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 18:18:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:18:06,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:06,321 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 18:18:06,323 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:06,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 18:18:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:06,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:06,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:08,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:08,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:08,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:08,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:08,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:08,262 INFO 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 18:18:08,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:08,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:08,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:08,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:08,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:08,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:13,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2018-12-03 18:18:13,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:18:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:18:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 18:18:13,225 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 18:18:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:13,390 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 18:18:13,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:18:13,391 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 18:18:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:13,391 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:18:13,392 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:18:13,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 18:18:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:18:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:18:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:18:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:18:13,396 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 18:18:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:13,396 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:18:13,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:18:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:18:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:18:13,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:13,396 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 18:18:13,396 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:13,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 18:18:13,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:13,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:13,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:13,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:13,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:16,045 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 18:18:16,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:16,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:16,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:16,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:16,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:16,045 INFO 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 18:18:16,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:16,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:16,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:16,100 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 18:18:16,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:21,185 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 18:18:21,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:21,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 102 [2018-12-03 18:18:21,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:21,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:18:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:18:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:18:21,206 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-12-03 18:18:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:21,295 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 18:18:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:18:21,295 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-12-03 18:18:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:21,296 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:18:21,296 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:18:21,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:18:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:18:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:18:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:18:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 18:18:21,300 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 18:18:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:21,300 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 18:18:21,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:18:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 18:18:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:18:21,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:21,300 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 18:18:21,301 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:21,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 18:18:21,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:21,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:21,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:23,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:23,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:23,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:23,496 INFO 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 18:18:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:23,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:23,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:18:23,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:23,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:23,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:29,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:29,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 104 [2018-12-03 18:18:29,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:29,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 18:18:29,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 18:18:29,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 18:18:29,221 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-12-03 18:18:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:29,387 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 18:18:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:18:29,388 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-12-03 18:18:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:29,389 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:18:29,389 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:18:29,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 18:18:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:18:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 18:18:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 18:18:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 18:18:29,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 18:18:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:29,393 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 18:18:29,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 18:18:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 18:18:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:18:29,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:29,394 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 18:18:29,394 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:29,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-12-03 18:18:29,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:29,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:29,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:29,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:29,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:31,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:31,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:31,254 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:31,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:31,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:31,254 INFO 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 18:18:31,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:31,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:31,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:31,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:31,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:31,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 106 [2018-12-03 18:18:36,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:36,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:18:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:18:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 18:18:36,804 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-12-03 18:18:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:36,883 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 18:18:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:18:36,884 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-12-03 18:18:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:36,885 INFO L225 Difference]: With dead ends: 58 [2018-12-03 18:18:36,885 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 18:18:36,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 18:18:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 18:18:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 18:18:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:18:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 18:18:36,889 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 18:18:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:36,890 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 18:18:36,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:18:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 18:18:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:18:36,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:36,890 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 18:18:36,891 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:36,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-12-03 18:18:36,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:36,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:36,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:36,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:36,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:39,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:39,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:39,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:39,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:39,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:39,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:18:39,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:39,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:39,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:39,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:44,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:44,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 108 [2018-12-03 18:18:44,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:44,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:18:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:18:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 18:18:44,934 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-12-03 18:18:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:45,018 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 18:18:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:18:45,018 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-12-03 18:18:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:45,019 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:18:45,019 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:18:45,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 18:18:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:18:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 18:18:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:18:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 18:18:45,023 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 18:18:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:45,023 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 18:18:45,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:18:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 18:18:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:18:45,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:45,024 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 18:18:45,024 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:45,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-12-03 18:18:45,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:45,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:47,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:47,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:47,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:47,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:47,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:47,045 INFO 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 18:18:47,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:47,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:47,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 18:18:47,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:47,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:47,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:53,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:53,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 110 [2018-12-03 18:18:53,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:53,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:18:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:18:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 18:18:53,020 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-12-03 18:18:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:53,118 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 18:18:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:18:53,119 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-12-03 18:18:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:53,120 INFO L225 Difference]: With dead ends: 60 [2018-12-03 18:18:53,120 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:18:53,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 18:18:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:18:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 18:18:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:18:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 18:18:53,124 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 18:18:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:53,124 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 18:18:53,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:18:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 18:18:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:18:53,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:53,125 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 18:18:53,125 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:53,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-12-03 18:18:53,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:53,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:53,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:53,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:55,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:55,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:55,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:55,482 INFO 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 18:18:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:55,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:55,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:55,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:55,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:55,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:01,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:01,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 112 [2018-12-03 18:19:01,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:01,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 18:19:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 18:19:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 18:19:01,775 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-12-03 18:19:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:01,903 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 18:19:01,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:19:01,903 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-12-03 18:19:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:01,904 INFO L225 Difference]: With dead ends: 61 [2018-12-03 18:19:01,904 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:19:01,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 18:19:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:19:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 18:19:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 18:19:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 18:19:01,907 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 18:19:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:01,907 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 18:19:01,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 18:19:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 18:19:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 18:19:01,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:01,908 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 18:19:01,908 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:01,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:01,908 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-12-03 18:19:01,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:01,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:01,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:04,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:04,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:04,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:04,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:04,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:04,270 INFO 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 18:19:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:04,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:04,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:04,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:10,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:10,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 114 [2018-12-03 18:19:10,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:10,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:19:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:19:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:19:10,571 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-12-03 18:19:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:10,695 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 18:19:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 18:19:10,695 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-12-03 18:19:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:10,696 INFO L225 Difference]: With dead ends: 62 [2018-12-03 18:19:10,696 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:19:10,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:19:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:19:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 18:19:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:19:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 18:19:10,700 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 18:19:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:10,701 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 18:19:10,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:19:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 18:19:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:19:10,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:10,701 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 18:19:10,701 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:10,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-12-03 18:19:10,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:10,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:10,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:10,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:10,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:12,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:12,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:12,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:12,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 18:19:12,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:12,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 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 18:19:12,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:12,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:12,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 18:19:12,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:12,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:13,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:19,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:19,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 116 [2018-12-03 18:19:19,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:19,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:19:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:19:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 18:19:19,654 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-12-03 18:19:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:19,753 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 18:19:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:19:19,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-12-03 18:19:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:19,755 INFO L225 Difference]: With dead ends: 63 [2018-12-03 18:19:19,755 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 18:19:19,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 18:19:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 18:19:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 18:19:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 18:19:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 18:19:19,759 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 18:19:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:19,759 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 18:19:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:19:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 18:19:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 18:19:19,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:19,760 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 18:19:19,760 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:19,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-12-03 18:19:19,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:19,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:19,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:19,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:22,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:22,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:22,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:22,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:22,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:22,230 INFO 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 18:19:22,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:22,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:22,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:22,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:22,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:22,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:29,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:29,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 118 [2018-12-03 18:19:29,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:29,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:19:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:19:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 18:19:29,628 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-12-03 18:19:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:29,753 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 18:19:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:19:29,754 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-12-03 18:19:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:29,754 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:19:29,754 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 18:19:29,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 18:19:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 18:19:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 18:19:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 18:19:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 18:19:29,759 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 18:19:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:29,759 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 18:19:29,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:19:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 18:19:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 18:19:29,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:29,759 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 18:19:29,760 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:29,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-12-03 18:19:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:29,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:29,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:34,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:34,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:34,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:34,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:34,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:34,471 INFO 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 18:19:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:34,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:34,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:34,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:41,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:41,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 120 [2018-12-03 18:19:41,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:41,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 18:19:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 18:19:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 18:19:41,803 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-12-03 18:19:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:41,919 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 18:19:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 18:19:41,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-12-03 18:19:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:41,920 INFO L225 Difference]: With dead ends: 65 [2018-12-03 18:19:41,920 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:19:41,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 18:19:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:19:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 18:19:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 18:19:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 18:19:41,924 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 18:19:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:41,924 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 18:19:41,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 18:19:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 18:19:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 18:19:41,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:41,925 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 18:19:41,925 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:41,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-12-03 18:19:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:41,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:41,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:44,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:44,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:44,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:44,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:44,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:44,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:19:44,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:44,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:44,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 18:19:44,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:44,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:44,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 122 [2018-12-03 18:19:52,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:52,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:19:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:19:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 18:19:52,193 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-12-03 18:19:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:52,282 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 18:19:52,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 18:19:52,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-12-03 18:19:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:52,283 INFO L225 Difference]: With dead ends: 66 [2018-12-03 18:19:52,283 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 18:19:52,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 18:19:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 18:19:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 18:19:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:19:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 18:19:52,287 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 18:19:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:52,287 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 18:19:52,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:19:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 18:19:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:19:52,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:52,288 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 18:19:52,288 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:52,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-12-03 18:19:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:52,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:52,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:55,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:55,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:55,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:55,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:55,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:55,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:19:55,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:55,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:55,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:55,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:55,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:55,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:03,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 124 [2018-12-03 18:20:03,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:03,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:20:03,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:20:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 18:20:03,368 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-12-03 18:20:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:03,502 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 18:20:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:20:03,503 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-12-03 18:20:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:03,504 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:20:03,504 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 18:20:03,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 18:20:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 18:20:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 18:20:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 18:20:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 18:20:03,507 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 18:20:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:03,508 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 18:20:03,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:20:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 18:20:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 18:20:03,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:03,508 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 18:20:03,509 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:03,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-12-03 18:20:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:03,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:03,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:06,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:06,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:06,356 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:06,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:06,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:06,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:20:06,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:06,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:06,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:06,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:14,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:14,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 126 [2018-12-03 18:20:14,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:14,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:20:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:20:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 18:20:14,181 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-12-03 18:20:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:14,314 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 18:20:14,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:20:14,314 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-12-03 18:20:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:14,315 INFO L225 Difference]: With dead ends: 68 [2018-12-03 18:20:14,315 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 18:20:14,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 18:20:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 18:20:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 18:20:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:20:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 18:20:14,319 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 18:20:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:14,319 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 18:20:14,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:20:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 18:20:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:20:14,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:14,319 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 18:20:14,320 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:14,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-12-03 18:20:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:14,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:14,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:17,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:17,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:17,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:17,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:17,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:17,221 INFO 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 18:20:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:17,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:17,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 18:20:17,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:17,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:17,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:25,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:25,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 128 [2018-12-03 18:20:25,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:25,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 18:20:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 18:20:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-12-03 18:20:25,270 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-03 18:20:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:25,399 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 18:20:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:20:25,406 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-03 18:20:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:25,407 INFO L225 Difference]: With dead ends: 69 [2018-12-03 18:20:25,407 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 18:20:25,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-12-03 18:20:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 18:20:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 18:20:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 18:20:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 18:20:25,410 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 18:20:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:25,410 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 18:20:25,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 18:20:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 18:20:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 18:20:25,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:25,411 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 18:20:25,411 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:25,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-12-03 18:20:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:25,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:25,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:28,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:28,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:28,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:28,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:28,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:28,445 INFO 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 18:20:28,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:28,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:28,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:28,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:28,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:28,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:37,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:37,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2018-12-03 18:20:37,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:37,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:20:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:20:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 18:20:37,014 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-12-03 18:20:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:37,145 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 18:20:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 18:20:37,145 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-12-03 18:20:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:37,146 INFO L225 Difference]: With dead ends: 70 [2018-12-03 18:20:37,146 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:20:37,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 18:20:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:20:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:20:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:20:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 18:20:37,151 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 18:20:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:37,151 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 18:20:37,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:20:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 18:20:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:20:37,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:37,152 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 18:20:37,152 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:37,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-12-03 18:20:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:37,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:37,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:40,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:40,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:40,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:40,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:40,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:40,195 INFO 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 18:20:40,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:40,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:40,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:40,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:48,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:48,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 132 [2018-12-03 18:20:48,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:48,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:20:48,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:20:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 18:20:48,882 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-12-03 18:20:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:49,136 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 18:20:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:20:49,136 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-12-03 18:20:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:49,137 INFO L225 Difference]: With dead ends: 71 [2018-12-03 18:20:49,137 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:20:49,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 18:20:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:20:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 18:20:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:20:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 18:20:49,141 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 18:20:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:49,142 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 18:20:49,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:20:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 18:20:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 18:20:49,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:49,142 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 18:20:49,143 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:49,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-12-03 18:20:49,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:49,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:49,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:52,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:52,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:52,282 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:52,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:52,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:52,283 INFO 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 18:20:52,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:52,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:52,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 18:20:52,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:52,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:01,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:01,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 134 [2018-12-03 18:21:01,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:01,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:21:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:21:01,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 18:21:01,064 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-12-03 18:21:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:01,187 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 18:21:01,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:21:01,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-12-03 18:21:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:01,189 INFO L225 Difference]: With dead ends: 72 [2018-12-03 18:21:01,189 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 18:21:01,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 18:21:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 18:21:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 18:21:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:21:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 18:21:01,193 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 18:21:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:01,193 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 18:21:01,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:21:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 18:21:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 18:21:01,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:01,193 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 18:21:01,193 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:01,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-12-03 18:21:01,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:01,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:01,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:04,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:04,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:04,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:04,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:04,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:04,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:21:04,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:04,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:04,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:04,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:04,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:04,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:13,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:13,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 136 [2018-12-03 18:21:13,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:13,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 18:21:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 18:21:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 18:21:13,619 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-12-03 18:21:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:13,772 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 18:21:13,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:21:13,773 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-12-03 18:21:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:13,774 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:21:13,774 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 18:21:13,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 18:21:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 18:21:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 18:21:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 18:21:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 18:21:13,778 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 18:21:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:13,778 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 18:21:13,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 18:21:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 18:21:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 18:21:13,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:13,779 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 18:21:13,779 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:13,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-12-03 18:21:13,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:13,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:13,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:17,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:17,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:17,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:17,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:17,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:17,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:21:17,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:17,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:21:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:17,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:17,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:26,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:26,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2018-12-03 18:21:26,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:26,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:21:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:21:26,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 18:21:26,411 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-12-03 18:21:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:26,515 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 18:21:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:21:26,516 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-12-03 18:21:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:26,517 INFO L225 Difference]: With dead ends: 74 [2018-12-03 18:21:26,517 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 18:21:26,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 18:21:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 18:21:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 18:21:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 18:21:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 18:21:26,521 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 18:21:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:26,521 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 18:21:26,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:21:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 18:21:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:21:26,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:26,522 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 18:21:26,522 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:26,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-12-03 18:21:26,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:26,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:29,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:29,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:29,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:29,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:29,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:29,958 INFO 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 18:21:29,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:21:29,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:21:30,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 18:21:30,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:30,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:30,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:39,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 140 [2018-12-03 18:21:39,567 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:39,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 18:21:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 18:21:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-12-03 18:21:39,569 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-12-03 18:21:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:39,743 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 18:21:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 18:21:39,744 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-12-03 18:21:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:39,745 INFO L225 Difference]: With dead ends: 75 [2018-12-03 18:21:39,745 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:21:39,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-12-03 18:21:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:21:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 18:21:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 18:21:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 18:21:39,749 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 18:21:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:39,749 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 18:21:39,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 18:21:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 18:21:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 18:21:39,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:39,750 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 18:21:39,750 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:39,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-12-03 18:21:39,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:39,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:39,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:43,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:43,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:43,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:43,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:43,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:43,273 INFO 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 18:21:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:43,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:43,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:43,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:43,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:43,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:53,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:53,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 142 [2018-12-03 18:21:53,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:53,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 18:21:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 18:21:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 18:21:53,930 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-12-03 18:21:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:54,099 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 18:21:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 18:21:54,100 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-12-03 18:21:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:54,101 INFO L225 Difference]: With dead ends: 76 [2018-12-03 18:21:54,101 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 18:21:54,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 18:21:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 18:21:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 18:21:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:21:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 18:21:54,106 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 18:21:54,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:54,106 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 18:21:54,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 18:21:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 18:21:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:21:54,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:54,107 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 18:21:54,107 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:54,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-12-03 18:21:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:54,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:54,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:57,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:57,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:57,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:57,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 18:21:57,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:57,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 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 18:21:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:57,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:21:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:57,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:57,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:07,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:07,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 144 [2018-12-03 18:22:07,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:07,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 18:22:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 18:22:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 18:22:07,580 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-12-03 18:22:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:07,710 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 18:22:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 18:22:07,710 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-12-03 18:22:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:07,711 INFO L225 Difference]: With dead ends: 77 [2018-12-03 18:22:07,711 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 18:22:07,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 18:22:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 18:22:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 18:22:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 18:22:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 18:22:07,715 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 18:22:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:07,716 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 18:22:07,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 18:22:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 18:22:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 18:22:07,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:07,717 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 18:22:07,717 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:07,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-12-03 18:22:07,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:07,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:07,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:11,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:11,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:11,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:11,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:11,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:11,541 INFO 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 18:22:11,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:22:11,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:22:11,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 18:22:11,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:11,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:11,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:21,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:21,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 146 [2018-12-03 18:22:21,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:21,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 18:22:21,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 18:22:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 18:22:21,991 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-12-03 18:22:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:22,156 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 18:22:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 18:22:22,157 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-12-03 18:22:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:22,158 INFO L225 Difference]: With dead ends: 78 [2018-12-03 18:22:22,158 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 18:22:22,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 18:22:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 18:22:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 18:22:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:22:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 18:22:22,162 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 18:22:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:22,162 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 18:22:22,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 18:22:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 18:22:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:22:22,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:22,163 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 18:22:22,163 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:22,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-12-03 18:22:22,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:22,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:22,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:22,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:22,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:25,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:25,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:25,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:25,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 18:22:25,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:25,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:22:25,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:22:25,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:22:25,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:22:25,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:26,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:26,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:36,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:36,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 148 [2018-12-03 18:22:36,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:36,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 18:22:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 18:22:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 18:22:36,793 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-12-03 18:22:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:36,963 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 18:22:36,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 18:22:36,964 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-12-03 18:22:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:36,965 INFO L225 Difference]: With dead ends: 79 [2018-12-03 18:22:36,965 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 18:22:36,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 18:22:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 18:22:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 18:22:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 18:22:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 18:22:36,969 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 18:22:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:36,969 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 18:22:36,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 18:22:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 18:22:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 18:22:36,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:36,970 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 18:22:36,970 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:36,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-12-03 18:22:36,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:36,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:36,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:36,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:36,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:40,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:40,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:40,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:40,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 18:22:40,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:40,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 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 18:22:40,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:40,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:22:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:40,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:40,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:51,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:51,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 150 [2018-12-03 18:22:51,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:51,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 18:22:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 18:22:51,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 18:22:51,676 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-12-03 18:22:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:51,851 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 18:22:51,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 18:22:51,852 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-12-03 18:22:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:51,852 INFO L225 Difference]: With dead ends: 80 [2018-12-03 18:22:51,853 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 18:22:51,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 18:22:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 18:22:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 18:22:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 18:22:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 18:22:51,856 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 18:22:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:51,856 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 18:22:51,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 18:22:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 18:22:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 18:22:51,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:51,857 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 18:22:51,857 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:51,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-12-03 18:22:51,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:51,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:51,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:55,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:55,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:55,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:55,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:55,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:55,642 INFO 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 18:22:55,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:22:55,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:22:55,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 18:22:55,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:55,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:55,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:06,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:06,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 152 [2018-12-03 18:23:06,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:06,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 18:23:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 18:23:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-12-03 18:23:06,651 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-12-03 18:23:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:06,830 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 18:23:06,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 18:23:06,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-12-03 18:23:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:06,831 INFO L225 Difference]: With dead ends: 81 [2018-12-03 18:23:06,831 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 18:23:06,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-12-03 18:23:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 18:23:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 18:23:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 18:23:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 18:23:06,835 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 18:23:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:06,836 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 18:23:06,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 18:23:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 18:23:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 18:23:06,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:06,837 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 18:23:06,837 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-12-03 18:23:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:06,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:06,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:10,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:10,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:10,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:10,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:10,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:10,766 INFO 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 18:23:10,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:23:10,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:23:10,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:23:10,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:10,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:10,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:21,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:21,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 154 [2018-12-03 18:23:21,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:21,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:23:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:23:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 18:23:21,967 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-12-03 18:23:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:22,082 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 18:23:22,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 18:23:22,083 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-12-03 18:23:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:22,084 INFO L225 Difference]: With dead ends: 82 [2018-12-03 18:23:22,084 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 18:23:22,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 18:23:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 18:23:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 18:23:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 18:23:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 18:23:22,089 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 18:23:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:22,089 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 18:23:22,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:23:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 18:23:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 18:23:22,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:22,090 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 18:23:22,090 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:22,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-12-03 18:23:22,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:22,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:22,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:22,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:25,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:25,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:25,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:25,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 18:23:25,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:25,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 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 18:23:25,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:25,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:23:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:26,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:26,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:37,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 156 [2018-12-03 18:23:37,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:37,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 18:23:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 18:23:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 18:23:37,431 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-12-03 18:23:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:38,113 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 18:23:38,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 18:23:38,114 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-12-03 18:23:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:38,115 INFO L225 Difference]: With dead ends: 83 [2018-12-03 18:23:38,115 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 18:23:38,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 18:23:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 18:23:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 18:23:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 18:23:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 18:23:38,119 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 18:23:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:38,119 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 18:23:38,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 18:23:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 18:23:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 18:23:38,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:38,120 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 18:23:38,120 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:38,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-12-03 18:23:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:38,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:38,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:38,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:38,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:42,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:42,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:42,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:42,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 18:23:42,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:42,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 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 18:23:42,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:23:42,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:23:42,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 18:23:42,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:42,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:42,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:54,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:54,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 158 [2018-12-03 18:23:54,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:54,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 18:23:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 18:23:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 18:23:54,403 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-12-03 18:23:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:54,802 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 18:23:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 18:23:54,802 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-12-03 18:23:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:54,803 INFO L225 Difference]: With dead ends: 84 [2018-12-03 18:23:54,803 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 18:23:54,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 18:23:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 18:23:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 18:23:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 18:23:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 18:23:54,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 18:23:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:54,808 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 18:23:54,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 18:23:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 18:23:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:23:54,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:54,808 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 18:23:54,808 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:54,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-12-03 18:23:54,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:54,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:54,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:54,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:54,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:59,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:59,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:59,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:59,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:59,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:59,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 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 18:23:59,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:23:59,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:23:59,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:23:59,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:59,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:59,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:11,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:11,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 160 [2018-12-03 18:24:11,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:11,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 18:24:11,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 18:24:11,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 18:24:11,298 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-12-03 18:24:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:11,432 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 18:24:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 18:24:11,432 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-12-03 18:24:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:11,433 INFO L225 Difference]: With dead ends: 85 [2018-12-03 18:24:11,433 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 18:24:11,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 18:24:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 18:24:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 18:24:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 18:24:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 18:24:11,438 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 18:24:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:11,438 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 18:24:11,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 18:24:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 18:24:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 18:24:11,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:11,439 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 18:24:11,439 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:11,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:11,440 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-12-03 18:24:11,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:11,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:11,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:11,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:15,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:15,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:15,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:15,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:15,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:15,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:24:15,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:15,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:24:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:16,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:16,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:28,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:28,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 162 [2018-12-03 18:24:28,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:28,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 18:24:28,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 18:24:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 18:24:28,378 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-12-03 18:24:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:28,584 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 18:24:28,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 18:24:28,585 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-12-03 18:24:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:28,585 INFO L225 Difference]: With dead ends: 86 [2018-12-03 18:24:28,585 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 18:24:28,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 18:24:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 18:24:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 18:24:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 18:24:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 18:24:28,588 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 18:24:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:28,588 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 18:24:28,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 18:24:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 18:24:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 18:24:28,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:28,589 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 18:24:28,589 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:28,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-12-03 18:24:28,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:28,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:28,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:32,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:32,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:32,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:32,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:32,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:32,916 INFO 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 18:24:32,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:24:32,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:24:33,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 18:24:33,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:33,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:33,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:45,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:45,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 164 [2018-12-03 18:24:45,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:45,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 18:24:45,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 18:24:45,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-12-03 18:24:45,924 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-12-03 18:24:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:46,109 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 18:24:46,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 18:24:46,109 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-12-03 18:24:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:46,110 INFO L225 Difference]: With dead ends: 87 [2018-12-03 18:24:46,110 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 18:24:46,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-12-03 18:24:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 18:24:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 18:24:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 18:24:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 18:24:46,114 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 18:24:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:46,115 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 18:24:46,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 18:24:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 18:24:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 18:24:46,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:46,115 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 18:24:46,115 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:46,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-12-03 18:24:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:46,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:46,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:50,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:50,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:50,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:50,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:50,759 INFO 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 18:24:50,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:24:50,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:24:50,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:24:50,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:50,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:50,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:03,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:03,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 166 [2018-12-03 18:25:03,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:25:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:25:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 18:25:03,749 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-12-03 18:25:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:03,899 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 18:25:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 18:25:03,899 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-12-03 18:25:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:03,900 INFO L225 Difference]: With dead ends: 88 [2018-12-03 18:25:03,900 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 18:25:03,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 18:25:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 18:25:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 18:25:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 18:25:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 18:25:03,904 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 18:25:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:03,904 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 18:25:03,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:25:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 18:25:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 18:25:03,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:03,905 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 18:25:03,905 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:03,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-12-03 18:25:03,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:03,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:03,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:03,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:03,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:08,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:08,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:08,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:08,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:08,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:08,550 INFO 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 18:25:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:08,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:25:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:08,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:08,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:23,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:23,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 168 [2018-12-03 18:25:23,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:23,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 18:25:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 18:25:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 18:25:23,172 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-12-03 18:25:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:23,388 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 18:25:23,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 18:25:23,389 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-12-03 18:25:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:23,389 INFO L225 Difference]: With dead ends: 89 [2018-12-03 18:25:23,389 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 18:25:23,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 18:25:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 18:25:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 18:25:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 18:25:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 18:25:23,394 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 18:25:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:23,395 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 18:25:23,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 18:25:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 18:25:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 18:25:23,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:23,396 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 18:25:23,396 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:23,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-12-03 18:25:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:23,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:23,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:28,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:28,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:28,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:28,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:28,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:28,054 INFO 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 18:25:28,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:25:28,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:25:28,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 18:25:28,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:28,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:28,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:41,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 170 [2018-12-03 18:25:41,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:41,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 18:25:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 18:25:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 18:25:41,698 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-12-03 18:25:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:41,841 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 18:25:41,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 18:25:41,842 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-12-03 18:25:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:41,843 INFO L225 Difference]: With dead ends: 90 [2018-12-03 18:25:41,843 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 18:25:41,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 18:25:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 18:25:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 18:25:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:25:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 18:25:41,847 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 18:25:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:41,847 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 18:25:41,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 18:25:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 18:25:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:25:41,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:41,848 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 18:25:41,848 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:41,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-12-03 18:25:41,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:41,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:41,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:46,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:46,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:46,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:46,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:46,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:46,727 INFO 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 18:25:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:25:46,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:25:46,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:25:46,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:46,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:46,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:00,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:00,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 172 [2018-12-03 18:26:00,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:00,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 18:26:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 18:26:00,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 18:26:00,672 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-12-03 18:26:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:00,838 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 18:26:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 18:26:00,839 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-12-03 18:26:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:00,840 INFO L225 Difference]: With dead ends: 91 [2018-12-03 18:26:00,840 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 18:26:00,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 18:26:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 18:26:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 18:26:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 18:26:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 18:26:00,844 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 18:26:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:00,845 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 18:26:00,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 18:26:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 18:26:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 18:26:00,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:00,845 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 18:26:00,846 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:00,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-12-03 18:26:00,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:00,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:00,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:26:00,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:00,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:05,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:05,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:05,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:05,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:05,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:05,769 INFO 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 18:26:05,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:26:05,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:26:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:05,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:05,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:20,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:20,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 174 [2018-12-03 18:26:20,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:20,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 18:26:20,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 18:26:20,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 18:26:20,033 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-12-03 18:26:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:20,187 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 18:26:20,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:26:20,187 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-12-03 18:26:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:20,188 INFO L225 Difference]: With dead ends: 92 [2018-12-03 18:26:20,188 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 18:26:20,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 18:26:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 18:26:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 18:26:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 18:26:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 18:26:20,194 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 18:26:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:20,194 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 18:26:20,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 18:26:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 18:26:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 18:26:20,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:20,195 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 18:26:20,195 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:20,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-12-03 18:26:20,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:20,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:26:20,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:20,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:25,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:25,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:25,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:25,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:25,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:25,184 INFO 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 18:26:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:26:25,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:26:25,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 18:26:25,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:26:25,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:25,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:39,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:39,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 176 [2018-12-03 18:26:39,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:39,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 18:26:39,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 18:26:39,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-12-03 18:26:39,826 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-12-03 18:26:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:40,037 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 18:26:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 18:26:40,038 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-12-03 18:26:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:40,038 INFO L225 Difference]: With dead ends: 93 [2018-12-03 18:26:40,039 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 18:26:40,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-12-03 18:26:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 18:26:40,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 18:26:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 18:26:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 18:26:40,042 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 18:26:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:40,042 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 18:26:40,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 18:26:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 18:26:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 18:26:40,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:40,043 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 18:26:40,043 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:40,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-12-03 18:26:40,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:40,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:40,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:26:40,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:40,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:45,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:45,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:45,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:45,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:45,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:45,118 INFO 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 18:26:45,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:26:45,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:26:45,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:26:45,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:26:45,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:45,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:00,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:00,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 178 [2018-12-03 18:27:00,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:00,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 18:27:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 18:27:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 18:27:00,091 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-12-03 18:27:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:00,359 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 18:27:00,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 18:27:00,360 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-12-03 18:27:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:00,360 INFO L225 Difference]: With dead ends: 94 [2018-12-03 18:27:00,361 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 18:27:00,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 18:27:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 18:27:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 18:27:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 18:27:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 18:27:00,365 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 18:27:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:00,365 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 18:27:00,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 18:27:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 18:27:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:27:00,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:00,366 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 18:27:00,366 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:00,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-12-03 18:27:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:00,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:00,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:00,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:00,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:05,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:05,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:05,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:05,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:05,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:05,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:27:05,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:05,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:27:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:05,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:05,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:20,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:20,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 180 [2018-12-03 18:27:20,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:20,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 18:27:20,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 18:27:20,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 18:27:20,892 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-12-03 18:27:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:21,046 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 18:27:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 18:27:21,046 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-12-03 18:27:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:21,047 INFO L225 Difference]: With dead ends: 95 [2018-12-03 18:27:21,047 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 18:27:21,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 18:27:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 18:27:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 18:27:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 18:27:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 18:27:21,052 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 18:27:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:21,052 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 18:27:21,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 18:27:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 18:27:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 18:27:21,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:21,052 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 18:27:21,053 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:21,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-12-03 18:27:21,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:21,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:21,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:26,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:26,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:26,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:26,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:26,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:26,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:27:26,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:27:26,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:27:26,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 18:27:26,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:26,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:26,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:42,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:42,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 182 [2018-12-03 18:27:42,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:42,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 18:27:42,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 18:27:42,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 18:27:42,151 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-12-03 18:27:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:42,410 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 18:27:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 18:27:42,410 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-12-03 18:27:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:42,411 INFO L225 Difference]: With dead ends: 96 [2018-12-03 18:27:42,411 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 18:27:42,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 18:27:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 18:27:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 18:27:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 18:27:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 18:27:42,415 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 18:27:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:42,415 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 18:27:42,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 18:27:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 18:27:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 18:27:42,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:42,416 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 18:27:42,416 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:42,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-12-03 18:27:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:42,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:42,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:47,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:47,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:47,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:47,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:47,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:47,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 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 18:27:47,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:27:47,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:27:47,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:27:47,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:47,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:47,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:03,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:03,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 184 [2018-12-03 18:28:03,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:03,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 18:28:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 18:28:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 18:28:03,713 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-12-03 18:28:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:03,896 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 18:28:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 18:28:03,897 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-12-03 18:28:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:03,898 INFO L225 Difference]: With dead ends: 97 [2018-12-03 18:28:03,898 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 18:28:03,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 18:28:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 18:28:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 18:28:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 18:28:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 18:28:03,903 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 18:28:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:03,903 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 18:28:03,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 18:28:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 18:28:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 18:28:03,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:03,904 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 18:28:03,904 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:03,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-12-03 18:28:03,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:03,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:28:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:03,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:09,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:09,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:09,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:09,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:09,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:09,460 INFO 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 18:28:09,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:09,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:28:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:09,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:09,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 186 [2018-12-03 18:28:25,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:25,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 18:28:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 18:28:25,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 18:28:25,620 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-12-03 18:28:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:25,795 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 18:28:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:28:25,796 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-12-03 18:28:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:25,797 INFO L225 Difference]: With dead ends: 98 [2018-12-03 18:28:25,797 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 18:28:25,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 18:28:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 18:28:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 18:28:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 18:28:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 18:28:25,801 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 18:28:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:25,802 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 18:28:25,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 18:28:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 18:28:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:28:25,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:25,802 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 18:28:25,803 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:25,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-12-03 18:28:25,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:25,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:25,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:31,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:31,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:31,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:31,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 18:28:31,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:31,440 INFO 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 18:28:31,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:28:31,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:28:31,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 18:28:31,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:28:31,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:31,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:48,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:48,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 188 [2018-12-03 18:28:48,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:48,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 18:28:48,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 18:28:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-12-03 18:28:48,101 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-12-03 18:28:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:48,381 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 18:28:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 18:28:48,382 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-12-03 18:28:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:48,383 INFO L225 Difference]: With dead ends: 99 [2018-12-03 18:28:48,383 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 18:28:48,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-12-03 18:28:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 18:28:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 18:28:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 18:28:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 18:28:48,387 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 18:28:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:48,388 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 18:28:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 18:28:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 18:28:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 18:28:48,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:48,388 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 18:28:48,388 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:48,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-12-03 18:28:48,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:48,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:28:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:48,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat