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_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:25:57,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:25:57,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:25:57,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:25:57,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:25:57,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:25:57,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:25:57,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:25:57,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:25:57,114 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:25:57,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:25:57,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:25:57,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:25:57,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:25:57,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:25:57,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:25:57,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:25:57,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:25:57,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:25:57,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:25:57,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:25:57,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:25:57,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:25:57,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:25:57,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:25:57,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:25:57,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:25:57,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:25:57,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:25:57,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:25:57,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:25:57,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:25:57,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:25:57,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:25:57,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:25:57,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:25:57,157 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:25:57,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:25:57,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:25:57,180 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:25:57,180 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:25:57,180 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:25:57,180 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:25:57,181 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:25:57,181 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:25:57,181 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:25:57,181 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:25:57,181 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:25:57,182 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:25:57,182 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:25:57,183 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:25:57,183 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:25:57,183 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:25:57,185 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:25:57,185 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:25:57,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:25:57,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:25:57,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:25:57,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:25:57,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:25:57,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:25:57,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:25:57,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:25:57,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:25:57,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:25:57,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:25:57,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:25:57,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:25:57,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:25:57,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:25:57,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:25:57,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:25:57,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:25:57,191 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:25:57,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:25:57,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:25:57,192 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:25:57,192 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:25:57,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:25:57,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:25:57,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:25:57,267 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:25:57,268 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:25:57,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2018-12-03 16:25:57,270 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2018-12-03 16:25:57,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:25:57,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:25:57,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:57,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:25:57,321 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:25:57,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:57,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:25:57,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:25:57,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:25:57,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/1) ... [2018-12-03 16:25:57,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:25:57,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:25:57,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:25:57,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:25:57,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (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 16:25:57,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:25:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:25:57,668 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:25:57,669 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:25:57,669 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:57 BoogieIcfgContainer [2018-12-03 16:25:57,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:25:57,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:25:57,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:25:57,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:25:57,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:57" (1/2) ... [2018-12-03 16:25:57,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46839716 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:25:57, skipping insertion in model container [2018-12-03 16:25:57,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:57" (2/2) ... [2018-12-03 16:25:57,677 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2018-12-03 16:25:57,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:25:57,696 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:25:57,714 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:25:57,749 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:25:57,749 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:25:57,749 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:25:57,749 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:25:57,749 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:25:57,750 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:25:57,750 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:25:57,750 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:25:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:25:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:25:57,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:57,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:25:57,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:57,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:25:57,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:57,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:57,959 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 16:25:57,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:57,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:57,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:57,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:57,983 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:25:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:58,052 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:25:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:58,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:25:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:58,078 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:25:58,078 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:25:58,085 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 16:25:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:25:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:25:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:25:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:25:58,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:25:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:58,126 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:25:58,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:25:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:25:58,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:58,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:25:58,128 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:58,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:25:58,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:58,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:58,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:58,284 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 16:25:58,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:58,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:58,286 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:25:58,289 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:25:58,379 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:25:58,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:25:58,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:25:58,949 INFO L272 AbstractInterpreter]: Visited 4 different actions 8 times. Merged at 1 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:25:58,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:58,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:25:58,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:58,967 INFO 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 16:25:58,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:58,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:58,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:59,010 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 16:25:59,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:59,058 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 16:25:59,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:59,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:25:59,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:59,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:25:59,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:25:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:59,081 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:25:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:59,113 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:25:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:25:59,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:25:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:59,115 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:25:59,115 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:25:59,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:25:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:25:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:25:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:25:59,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:25:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:59,119 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:25:59,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:25:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:25:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:25:59,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:59,121 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:25:59,122 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:59,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:59,123 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:25:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:59,222 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 16:25:59,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:59,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:59,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:59,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,224 INFO 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 16:25:59,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:59,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:59,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:25:59,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:59,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:59,284 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 16:25:59,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:59,562 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 16:25:59,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:59,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:25:59,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:59,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:25:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:25:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:59,587 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 16:25:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:59,616 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:25:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:25:59,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:25:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:59,618 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:25:59,619 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:25:59,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:25:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:25:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:25:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:25:59,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:25:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:59,623 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:25:59,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:25:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:25:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:25:59,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:59,624 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:25:59,624 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:59,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:25:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:59,732 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 16:25:59,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:59,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:59,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:59,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,733 INFO 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 16:25:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:59,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:59,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:59,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:59,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:59,772 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 16:25:59,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,044 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 16:26:00,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:26:00,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:26:00,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:26:00,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:26:00,064 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 16:26:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:00,090 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:26:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:26:00,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:26:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:00,091 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:26:00,091 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:26:00,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:26:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:26:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:26:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:26:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:26:00,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:26:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:00,096 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:26:00,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:26:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:26:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:26:00,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:00,097 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:26:00,097 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:00,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:26:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:00,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:00,187 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 16:26:00,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:00,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:00,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:00,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,189 INFO 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 16:26:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:00,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:00,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:00,215 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 16:26:00,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,360 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 16:26:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:26:00,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:26:00,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:26:00,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:26:00,383 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:26:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:00,412 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:26:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:26:00,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:26:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:00,414 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:26:00,414 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:26:00,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:26:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:26:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:26:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:26:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:26:00,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:26:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:00,419 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:26:00,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:26:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:26:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:26:00,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:00,420 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:26:00,420 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:00,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:26:00,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:00,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:00,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:00,809 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 16:26:00,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:00,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:00,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 16:26:00,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,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 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 16:26:00,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:00,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:00,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:26:00,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:00,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:00,839 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 16:26:00,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,977 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 16:26:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:26:00,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:26:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:26:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:26:00,999 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 16:26:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:01,038 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:26:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:26:01,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:26:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:01,040 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:26:01,041 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:26:01,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:26:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:26:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:26:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:26:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:26:01,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:26:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:01,044 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:26:01,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:26:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:26:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:26:01,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:01,045 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:26:01,045 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 16:26:01,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:01,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:01,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,144 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 16:26:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:01,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:01,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:01,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:01,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:01,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:01,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:01,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:01,177 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 16:26:01,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:01,346 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 16:26:01,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:26:01,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:01,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:26:01,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:26:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:26:01,368 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 16:26:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:01,399 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:26:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:26:01,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:26:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:01,400 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:26:01,401 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:26:01,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:26:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:26:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:26:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:26:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:26:01,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:26:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:01,404 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:26:01,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:26:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:26:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:26:01,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:01,405 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:26:01,405 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:01,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 16:26:01,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:01,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:01,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,660 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 16:26:01,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:01,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:01,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:01,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:01,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:01,704 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 16:26:01,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:01,942 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 16:26:01,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:01,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:26:01,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:01,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:26:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:26:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:26:01,963 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 16:26:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:02,001 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:26:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:26:02,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:26:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:02,006 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:26:02,006 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:26:02,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:26:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:26:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:26:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:26:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:26:02,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:26:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:02,010 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:26:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:26:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:26:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:26:02,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:02,011 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:26:02,011 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:02,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 16:26:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,259 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 16:26:02,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:02,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:02,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:02,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,260 INFO 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 16:26:02,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:02,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:02,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:26:02,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:02,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,302 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 16:26:02,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:02,494 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 16:26:02,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:02,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:26:02,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:02,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:26:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:26:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:26:02,516 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 16:26:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:02,557 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:26:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:26:02,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:26:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:02,558 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:26:02,558 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:26:02,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:26:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:26:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:26:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:26:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:26:02,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:26:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:02,561 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:26:02,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:26:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:26:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:26:02,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:02,562 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:26:02,562 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:02,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 16:26:02,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:02,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:02,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,676 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 16:26:02,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:02,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:02,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:02,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:02,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:02,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:02,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:02,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,710 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 16:26:02,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:02,915 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 16:26:02,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:02,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:26:02,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:02,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:26:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:26:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:26:02,938 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 16:26:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:02,968 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:26:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:26:02,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:26:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:02,969 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:26:02,970 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:26:02,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:26:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:26:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:26:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:26:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:26:02,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:26:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:02,974 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:26:02,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:26:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:26:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:26:02,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:02,975 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:26:02,975 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:02,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 16:26:02,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:02,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:03,110 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 16:26:03,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:03,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:03,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:03,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:03,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:03,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:03,149 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 16:26:03,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:03,468 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 16:26:03,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:03,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:26:03,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:03,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:26:03,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:26:03,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:26:03,490 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 16:26:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:03,523 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:26:03,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:26:03,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 16:26:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:03,524 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:26:03,525 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:26:03,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:26:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:26:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:26:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:26:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:26:03,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:26:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:26:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:26:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:26:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:26:03,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:03,531 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:26:03,531 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:03,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 16:26:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:03,754 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 16:26:03,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:03,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:03,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:03,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,756 INFO 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 16:26:03,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:03,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:03,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:26:03,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:03,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:03,802 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 16:26:03,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:04,181 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 16:26:04,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:04,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:26:04,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:04,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:26:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:26:04,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:26:04,203 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 16:26:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:04,227 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:26:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:26:04,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 16:26:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:04,235 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:26:04,236 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:26:04,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:26:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:26:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:26:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:26:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:26:04,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:26:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:04,239 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:26:04,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:26:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:26:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:26:04,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:04,240 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:26:04,240 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:04,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 16:26:04,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:04,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:04,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:04,389 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 16:26:04,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:04,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:04,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:04,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:04,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:04,390 INFO 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 16:26:04,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:04,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:04,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:04,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:04,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:04,449 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 16:26:04,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:05,414 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 16:26:05,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:05,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:26:05,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:05,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:26:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:26:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:26:05,437 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 16:26:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:05,490 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:26:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:26:05,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:26:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:05,492 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:26:05,493 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:26:05,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:26:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:26:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:26:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:26:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:26:05,501 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:26:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:05,502 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:26:05,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:26:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:26:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:26:05,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:05,503 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:26:05,503 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:05,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 16:26:05,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,744 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 16:26:05,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:05,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:05,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:05,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,746 INFO 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 16:26:05,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:05,781 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 16:26:05,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:06,456 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 16:26:06,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:06,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:26:06,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:06,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:26:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:26:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:26:06,479 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 16:26:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:06,511 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:26:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:26:06,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 16:26:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:06,515 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:26:06,515 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:26:06,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:26:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:26:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:26:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:26:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:26:06,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:26:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:06,519 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:26:06,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:26:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:26:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:26:06,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:06,520 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:26:06,520 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:06,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 16:26:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:06,734 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 16:26:06,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:06,735 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:06,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:06,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,736 INFO 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 16:26:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:06,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:06,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:26:06,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:06,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:06,831 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 16:26:06,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:07,333 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 16:26:07,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:07,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:26:07,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:07,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:26:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:26:07,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:26:07,356 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 16:26:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:07,438 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:26:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:26:07,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 16:26:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:07,440 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:26:07,440 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:26:07,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:26:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:26:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:26:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:26:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:26:07,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:26:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:07,445 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:26:07,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:26:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:26:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:26:07,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:07,447 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:26:07,447 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:07,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 16:26:07,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,695 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 16:26:07,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:07,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:07,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:07,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,696 INFO 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 16:26:07,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:07,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:07,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:07,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:07,750 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 16:26:07,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:08,247 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 16:26:08,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:08,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:26:08,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:08,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:26:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:26:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:26:08,268 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 16:26:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:08,313 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:26:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:26:08,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:26:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:08,321 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:26:08,321 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:26:08,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:26:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:26:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:26:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:26:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:26:08,326 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:26:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:08,326 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:26:08,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:26:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:26:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:26:08,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:08,327 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:26:08,327 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:08,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 16:26:08,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:08,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:08,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:08,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:09,013 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 16:26:09,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:09,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:09,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:09,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:09,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:09,014 INFO 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 16:26:09,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:09,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:09,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:09,061 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 16:26:09,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:09,643 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 16:26:09,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:09,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:26:09,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:09,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:26:09,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:26:09,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:26:09,665 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 16:26:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:09,691 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:26:09,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:26:09,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 16:26:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:09,693 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:26:09,694 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:26:09,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:26:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:26:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:26:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:26:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:26:09,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 16:26:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:09,697 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:26:09,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:26:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:26:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:26:09,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:09,698 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 16:26:09,698 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:09,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 16:26:09,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:09,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:09,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:10,444 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 16:26:10,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:10,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:10,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:10,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 16:26:10,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:10,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 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 16:26:10,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:10,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:10,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:26:10,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:10,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:10,488 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 16:26:10,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:11,200 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 16:26:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:26:11,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:11,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:26:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:26:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:26:11,222 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 16:26:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:11,250 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 16:26:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:26:11,252 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 16:26:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:11,253 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:26:11,253 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:26:11,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:26:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:26:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:26:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:26:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:26:11,257 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 16:26:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:11,258 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:26:11,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:26:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:26:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:26:11,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:11,259 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 16:26:11,259 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:11,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:11,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 16:26:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:11,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:11,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:12,124 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 16:26:12,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:12,125 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:12,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:12,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,125 INFO 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 16:26:12,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:12,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:12,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:12,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:12,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:12,174 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 16:26:12,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:12,642 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 16:26:12,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:12,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:26:12,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:12,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:26:12,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:26:12,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:26:12,665 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 16:26:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:12,702 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:26:12,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:26:12,702 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:26:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:12,703 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:26:12,703 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:26:12,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:26:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:26:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:26:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:26:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:26:12,708 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 16:26:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:12,709 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:26:12,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:26:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:26:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:26:12,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:12,710 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 16:26:12,710 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:12,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 16:26:12,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:12,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:12,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:12,961 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 16:26:12,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:12,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:12,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:12,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,963 INFO 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 16:26:12,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:12,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:13,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:13,014 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 16:26:13,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:13,817 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 16:26:13,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:13,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:26:13,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:13,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:26:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:26:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:26:13,840 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 16:26:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:13,883 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 16:26:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:26:13,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 16:26:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:13,887 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:26:13,887 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:26:13,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:26:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:26:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:26:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:26:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:26:13,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 16:26:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:13,891 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:26:13,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:26:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:26:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:26:13,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:13,891 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 16:26:13,892 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:13,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 16:26:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:14,213 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 16:26:14,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:14,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:14,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 16:26:14,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,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 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 16:26:14,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:14,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:14,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:26:14,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:14,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:14,267 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 16:26:14,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:14,801 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 16:26:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:14,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:26:14,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:14,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:26:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:26:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:26:14,822 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 16:26:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:14,866 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:26:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:26:14,868 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 16:26:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:14,868 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:26:14,869 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:26:14,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:26:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:26:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:26:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:26:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 16:26:14,873 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 16:26:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:14,873 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 16:26:14,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:26:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 16:26:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:26:14,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:14,874 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 16:26:14,874 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:14,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 16:26:14,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:14,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:14,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:14,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:14,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:15,501 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 16:26:15,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:15,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:15,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:15,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:15,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:15,502 INFO 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 16:26:15,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:15,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:15,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:15,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:15,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:15,542 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 16:26:15,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:16,082 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 16:26:16,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:16,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:26:16,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:16,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:26:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:26:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:26:16,106 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 16:26:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:16,205 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 16:26:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:26:16,208 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 16:26:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:16,208 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:26:16,209 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:26:16,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:26:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:26:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:26:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:26:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:26:16,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 16:26:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:16,214 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:26:16,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:26:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:26:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:26:16,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:16,215 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 16:26:16,215 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:16,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 16:26:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:16,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:16,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:17,220 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 16:26:17,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:17,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26: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 16:26:17,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26: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 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 16:26:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:17,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:17,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:17,263 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 16:26:17,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:18,002 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 16:26:18,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:18,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:26:18,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:18,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:26:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:26:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:26:18,022 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 16:26:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:18,057 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:26:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:26:18,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 16:26:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:18,060 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:26:18,060 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:26:18,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:26:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:26:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:26:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:26:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:26:18,064 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 16:26:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:18,065 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:26:18,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:26:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:26:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:26:18,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:18,066 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 16:26:18,066 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:18,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 16:26:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:18,443 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 16:26:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:18,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:18,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:18,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:18,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 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 16:26:18,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:18,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:18,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:26:18,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:18,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:18,505 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 16:26:18,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:19,592 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 16:26:19,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:26:19,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:19,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:26:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:26:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:26:19,613 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 16:26:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:19,667 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 16:26:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:26:19,671 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 16:26:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:19,671 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:26:19,671 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:26:19,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:26:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:26:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:26:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:26:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:26:19,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 16:26:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:19,676 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:26:19,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:26:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:26:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:26:19,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:19,677 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 16:26:19,678 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 16:26:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:19,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:19,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:20,344 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 16:26:20,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:20,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:20,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:20,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:20,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:20,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:20,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:20,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:20,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:20,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:20,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:20,391 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 16:26:20,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:21,135 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 16:26:21,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:21,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:26:21,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:21,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:26:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:26:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:26:21,156 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 16:26:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:21,213 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:26:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:26:21,214 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 16:26:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:21,214 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:26:21,215 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:26:21,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:26:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:26:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:26:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:26:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 16:26:21,220 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 16:26:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:21,221 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 16:26:21,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:26:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 16:26:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:26:21,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:21,222 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 16:26:21,222 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:21,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 16:26:21,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:21,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:21,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:21,559 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 16:26:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:21,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:21,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,560 INFO 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 16:26:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:21,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:21,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:21,604 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 16:26:21,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:22,772 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 16:26:22,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:22,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:26:22,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:22,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:26:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:26:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:26:22,795 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 16:26:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:22,919 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 16:26:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:26:22,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 16:26:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:22,921 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:26:22,921 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:26:22,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:26:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:26:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:26:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:26:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:26:22,925 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 16:26:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:22,925 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:26:22,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:26:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:26:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:26:22,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:22,926 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 16:26:22,926 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:22,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 16:26:22,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:22,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:23,619 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 16:26:23,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:23,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:23,619 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:23,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:23,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:23,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:23,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:23,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:26:23,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:23,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:23,692 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 16:26:23,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:24,526 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 16:26:24,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:24,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:26:24,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:24,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:26:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:26:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:26:24,548 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 16:26:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:24,810 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:26:24,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:26:24,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 16:26:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:24,811 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:26:24,811 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:26:24,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:26:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:26:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:26:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:26:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:26:24,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 16:26:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:24,816 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:26:24,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:26:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:26:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:26:24,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:24,817 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 16:26:24,817 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:24,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 16:26:24,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:24,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:24,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:24,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:24,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:25,209 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 16:26:25,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:25,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:25,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:25,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:25,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:25,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:25,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:25,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:25,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:25,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:25,257 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 16:26:25,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:26,362 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 16:26:26,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:26,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:26:26,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:26,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:26:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:26:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:26:26,382 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 16:26:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:26,414 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 16:26:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:26:26,414 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 16:26:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:26,415 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:26:26,415 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:26:26,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:26:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:26:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:26:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:26:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:26:26,421 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 16:26:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:26,421 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:26:26,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:26:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:26:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:26:26,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:26,422 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 16:26:26,422 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:26,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 16:26:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:26,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:26,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:26,996 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 16:26:26,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:26,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:26,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:26,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:26,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:26,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:27,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:27,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:27,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:27,042 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 16:26:27,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:28,145 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 16:26:28,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:28,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:26:28,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:28,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:26:28,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:26:28,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:26:28,166 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 16:26:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:28,289 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:26:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:26:28,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 16:26:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:28,290 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:26:28,290 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:26:28,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:26:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:26:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:26:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:26:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 16:26:28,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 16:26:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:28,295 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 16:26:28,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:26:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 16:26:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:26:28,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:28,296 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 16:26:28,296 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:28,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:28,297 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 16:26:28,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:28,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:28,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:28,843 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 16:26:28,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:28,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:28,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:28,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,844 INFO 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 16:26:28,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:28,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:28,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:26:28,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:28,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:28,932 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 16:26:28,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:30,368 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 16:26:30,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:30,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:26:30,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:30,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:26:30,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:26:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:26:30,391 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 16:26:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:30,482 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 16:26:30,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:26:30,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 16:26:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:30,484 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:26:30,484 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:26:30,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:26:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:26:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:26:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:26:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:26:30,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 16:26:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:30,488 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:26:30,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:26:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:26:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:26:30,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:30,489 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 16:26:30,489 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:30,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 16:26:30,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:30,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:30,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:31,140 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 16:26:31,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:31,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:31,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:31,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:31,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:31,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:31,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:31,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:31,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:31,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:31,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:31,192 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 16:26:31,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:32,217 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 16:26:32,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:32,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:26:32,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:32,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:26:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:26:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:32,238 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 16:26:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:32,298 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:26:32,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:26:32,299 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 16:26:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:32,300 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:26:32,300 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:26:32,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:26:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:26:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:26:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:26:32,303 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 16:26:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:32,303 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:26:32,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:26:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:26:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:26:32,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:32,304 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 16:26:32,304 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:32,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 16:26:32,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:32,760 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 16:26:32,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:32,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:32,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:32,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:32,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:32,761 INFO 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 16:26:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:32,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:32,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:32,806 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 16:26:32,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:33,911 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 16:26:33,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:33,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:26:33,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:33,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:26:33,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:26:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:33,932 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 16:26:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:33,999 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 16:26:34,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:26:34,000 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 16:26:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:34,000 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:26:34,001 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:26:34,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:26:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:26:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:26:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:26:34,008 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 16:26:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:34,008 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:26:34,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:26:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:26:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:26:34,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:34,009 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 16:26:34,009 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:34,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 16:26:34,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:34,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:34,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:34,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:34,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:34,529 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 16:26:34,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:34,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:34,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:34,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:34,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:34,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:34,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:34,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:26:34,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:34,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:34,625 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 16:26:34,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:36,067 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 16:26:36,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:36,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:26:36,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:36,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:26:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:26:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:36,088 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 16:26:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:36,154 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:26:36,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:26:36,155 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 16:26:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:36,156 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:26:36,156 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:26:36,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:26:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:26:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:26:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 16:26:36,160 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 16:26:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:36,161 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 16:26:36,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:26:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 16:26:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:26:36,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:36,161 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 16:26:36,162 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:36,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 16:26:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:36,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:36,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:36,791 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 16:26:36,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:36,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:36,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:36,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:36,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:36,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:36,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:36,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:36,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:36,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:36,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:36,853 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 16:26:36,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:38,091 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 16:26:38,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:38,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:26:38,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:38,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:26:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:26:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:38,112 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 16:26:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:38,220 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 16:26:38,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:26:38,220 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 16:26:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:38,221 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:26:38,221 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:26:38,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:26:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:26:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:26:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:26:38,224 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 16:26:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:38,224 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:26:38,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:26:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:26:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:26:38,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:38,225 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 16:26:38,225 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:38,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 16:26:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:39,517 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 16:26:39,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:39,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:39,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:39,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,518 INFO 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 16:26:39,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:39,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:39,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:39,578 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 16:26:39,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:41,496 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 16:26:41,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:41,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:26:41,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:41,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:26:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:26:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:41,515 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 16:26:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:41,584 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:26:41,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:26:41,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 16:26:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:41,586 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:26:41,586 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:26:41,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:26:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:26:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:26:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 16:26:41,590 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 16:26:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:41,590 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 16:26:41,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:26:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 16:26:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:26:41,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:41,591 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 16:26:41,592 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:41,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 16:26:41,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:41,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:41,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:42,271 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 16:26:42,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:42,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:42,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:42,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:42,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:42,272 INFO 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 16:26:42,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:42,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:42,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:26:42,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:42,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:42,384 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 16:26:42,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:43,838 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 16:26:43,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:43,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:26:43,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:43,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:26:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:26:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:43,861 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 16:26:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:43,912 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 16:26:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:26:43,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 16:26:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:43,913 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:26:43,913 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:26:43,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:26:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:26:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:26:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:26:43,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 16:26:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:43,916 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:26:43,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:26:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:26:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:26:43,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:43,917 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 16:26:43,917 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:43,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 16:26:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:43,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:43,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:44,562 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 16:26:44,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:44,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:44,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:44,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:44,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:44,564 INFO 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 16:26:44,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:44,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:44,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:44,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:44,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:44,620 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 16:26:44,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:46,668 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 16:26:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:46,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:26:46,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:46,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:26:46,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:26:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:46,690 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 16:26:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:46,747 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:26:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:26:46,747 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 16:26:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:46,748 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:26:46,748 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:26:46,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:26:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:26:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:26:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 16:26:46,750 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 16:26:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:46,750 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 16:26:46,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:26:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 16:26:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:26:46,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:46,751 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 16:26:46,751 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:46,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:46,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 16:26:46,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:46,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:46,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:47,496 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 16:26:47,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:47,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:47,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:47,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:47,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:47,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 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 16:26:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:47,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:47,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:47,548 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 16:26:47,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:49,122 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 16:26:49,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:49,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:26:49,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:49,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:26:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:26:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:49,142 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 16:26:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:49,230 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 16:26:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:26:49,230 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 16:26:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:49,231 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:26:49,231 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:26:49,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:26:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:26:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:26:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:26:49,235 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 16:26:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:49,235 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:26:49,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:26:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:26:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:26:49,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:49,236 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 16:26:49,236 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:49,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 16:26:49,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:49,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:49,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:49,899 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 16:26:49,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:49,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:49,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:49,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:49,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:49,900 INFO 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 16:26:49,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:49,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:50,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:26:50,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:50,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:50,033 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 16:26:50,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:51,993 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 16:26:52,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:52,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:26:52,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:52,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:26:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:26:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:26:52,014 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 16:26:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:52,072 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:26:52,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:26:52,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 16:26:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:52,073 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:26:52,074 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:26:52,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:26:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:26:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:26:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:26:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 16:26:52,076 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 16:26:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:52,076 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 16:26:52,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:26:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 16:26:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:26:52,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:52,077 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 16:26:52,077 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:52,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 16:26:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:52,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:52,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:53,185 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 16:26:53,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:53,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:53,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:53,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:53,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:53,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:53,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:53,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:53,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:53,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:53,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:53,240 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 16:26:53,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:54,938 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 16:26:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:54,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:26:54,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:54,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:26:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:26:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:26:54,958 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 16:26:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:55,030 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 16:26:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:26:55,030 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 16:26:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:55,031 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:26:55,031 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:26:55,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:26:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:26:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:26:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:26:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:26:55,034 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 16:26:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:55,034 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:26:55,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:26:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:26:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:26:55,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:55,035 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 16:26:55,035 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:55,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 16:26:55,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:55,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:55,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:55,743 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 16:26:55,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:55,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:55,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:55,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:55,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:55,744 INFO 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 16:26:55,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:55,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:55,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:55,808 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 16:26:55,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:57,908 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 16:26:57,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:57,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:26:57,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:57,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:26:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:26:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:26:57,928 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 16:26:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:58,024 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:26:58,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:26:58,026 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 16:26:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:58,026 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:26:58,027 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:26:58,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:26:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:26:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:26:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:26:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 16:26:58,029 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 16:26:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:58,029 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 16:26:58,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:26:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 16:26:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:26:58,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:58,030 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 16:26:58,030 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:58,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 16:26:58,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:58,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:58,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:58,790 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 16:26:58,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:58,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:58,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:58,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:58,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:58,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:26:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:58,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:58,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:26:58,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:58,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:58,949 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 16:26:58,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:00,901 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 16:27:00,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:00,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:27:00,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:00,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:27:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:27:00,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:00,923 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 16:27:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:01,002 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 16:27:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:27:01,003 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 16:27:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:01,004 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:27:01,004 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:27:01,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:27:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:27:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:27:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:27:01,006 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 16:27:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:01,006 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:27:01,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:27:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:27:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:27:01,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:01,007 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 16:27:01,007 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:01,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-03 16:27:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:01,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:01,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:02,040 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 16:27:02,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:02,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:02,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:02,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:02,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:02,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:27:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:02,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:02,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:02,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:02,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:02,100 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 16:27:02,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:04,408 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 16:27:04,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:04,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:27:04,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:04,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:27:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:27:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:04,429 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 16:27:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:04,484 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:27:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:27:04,485 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 16:27:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:04,485 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:27:04,486 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:27:04,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:27:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:27:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:27:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 16:27:04,489 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 16:27:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:04,490 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 16:27:04,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:27:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 16:27:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:27:04,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:04,490 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 16:27:04,491 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:04,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-03 16:27:04,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:04,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:04,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:05,318 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 16:27:05,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:05,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:05,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:05,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:05,319 INFO 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 16:27:05,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:05,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:05,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:05,383 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 16:27:05,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:07,818 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 16:27:07,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:07,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:27:07,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:07,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:27:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:27:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:07,839 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 16:27:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:07,938 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 16:27:07,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:27:07,939 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 16:27:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:07,939 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:27:07,939 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:27:07,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:27:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:27:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:27:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:27:07,942 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 16:27:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:07,943 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:27:07,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:27:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:27:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:27:07,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:07,943 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 16:27:07,944 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:07,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:07,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-03 16:27:07,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:07,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:07,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:08,775 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 16:27:08,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:08,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:08,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:08,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:08,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:08,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:27:08,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:08,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:08,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:27:08,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:08,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:08,954 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 16:27:08,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:11,164 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 16:27:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:27:11,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:11,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:27:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:27:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:27:11,185 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 16:27:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:11,242 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:27:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:27:11,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 16:27:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:11,243 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:27:11,243 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:27:11,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:27:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:27:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:27:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:27:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 16:27:11,247 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 16:27:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:11,247 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 16:27:11,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:27:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 16:27:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:27:11,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:11,248 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 16:27:11,248 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:11,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-03 16:27:11,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:11,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:12,318 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 16:27:12,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:12,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:12,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:12,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:12,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:12,319 INFO 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 16:27:12,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:12,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:12,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:12,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:12,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:12,386 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 16:27:12,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:14,727 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 16:27:14,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:27:14,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:14,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:27:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:27:14,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:27:14,747 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 16:27:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:15,073 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 16:27:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:27:15,074 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 16:27:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:15,074 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:27:15,074 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:27:15,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:27:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:27:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:27:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:27:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:27:15,076 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 16:27:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:15,078 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:27:15,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:27:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:27:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:27:15,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:15,078 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 16:27:15,079 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:15,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-03 16:27:15,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:15,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:15,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:15,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:15,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:16,171 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 16:27:16,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:16,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:16,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:16,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:16,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:16,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:27:16,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:16,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:16,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:16,246 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 16:27:16,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:18,945 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 16:27:18,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:18,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:27:18,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:18,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:27:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:27:18,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:27:18,965 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 16:27:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:19,059 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:27:19,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:27:19,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 16:27:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:19,060 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:27:19,061 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:27:19,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:27:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:27:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:27:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:27:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 16:27:19,063 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 16:27:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:19,063 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 16:27:19,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:27:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 16:27:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:27:19,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:19,064 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 16:27:19,064 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:19,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:19,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-03 16:27:19,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:19,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:19,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:19,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:19,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:20,199 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 16:27:20,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:20,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:20,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:20,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:20,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:20,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:27:20,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:20,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:20,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:27:20,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:20,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:20,413 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 16:27:20,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:23,250 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 16:27:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:27:23,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:23,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:27:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:27:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:27:23,271 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 16:27:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:23,330 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 16:27:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:27:23,331 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 16:27:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:23,332 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:27:23,332 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:27:23,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:27:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:27:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:27:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:27:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:27:23,335 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 16:27:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:23,335 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:27:23,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:27:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:27:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:27:23,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:23,336 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 16:27:23,336 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-03 16:27:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:23,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:23,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:24,326 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 16:27:24,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:24,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:24,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:24,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:24,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:24,326 INFO 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 16:27:24,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:24,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:24,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:24,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:24,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:24,395 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 16:27:24,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:27,238 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 16:27:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:27:27,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:27,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:27:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:27:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:27:27,269 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 16:27:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:27,427 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:27:27,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:27:27,427 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 16:27:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:27,428 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:27:27,428 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:27:27,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:27:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:27:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:27:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:27:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 16:27:27,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 16:27:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:27,431 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 16:27:27,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:27:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 16:27:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:27:27,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:27,432 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 16:27:27,432 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:27,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-03 16:27:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:27,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:27,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:28,560 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 16:27:28,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:28,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:28,560 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:28,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:28,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:28,560 INFO 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 16:27:28,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:28,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:28,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:28,630 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 16:27:28,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:31,799 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 16:27:31,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:31,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:27:31,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:31,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:27:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:27:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:27:31,821 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 16:27:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:31,938 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 16:27:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:27:31,938 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 16:27:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:31,939 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:27:31,939 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:27:31,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:27:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:27:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:27:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:27:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:27:31,941 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 16:27:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:31,941 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:27:31,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:27:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:27:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:27:31,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:31,942 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 16:27:31,942 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:31,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-03 16:27:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:31,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:31,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:33,183 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 16:27:33,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:33,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:33,183 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:33,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:33,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:33,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 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 16:27:33,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:33,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:33,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:27:33,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:33,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:33,443 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 16:27:33,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:36,290 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 16:27:36,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:36,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:27:36,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:36,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:27:36,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:27:36,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:27:36,321 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 16:27:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:36,491 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:27:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:27:36,492 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 16:27:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:36,493 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:27:36,493 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:27:36,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:27:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:27:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:27:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:27:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 16:27:36,496 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 16:27:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:36,496 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 16:27:36,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:27:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 16:27:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:27:36,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:36,497 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 16:27:36,497 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:36,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-03 16:27:36,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:36,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:36,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:38,031 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 16:27:38,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:38,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:38,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:38,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:38,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:38,031 INFO 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 16:27:38,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:38,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:38,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:38,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:38,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:38,105 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 16:27:38,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:41,065 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 16:27:41,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:41,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:27:41,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:41,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:27:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:27:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:27:41,086 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 16:27:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:41,186 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 16:27:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:27:41,186 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 16:27:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:41,187 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:27:41,187 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:27:41,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:27:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:27:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:27:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:27:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 16:27:41,189 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 16:27:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:41,189 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 16:27:41,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:27:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 16:27:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:27:41,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:41,190 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 16:27:41,190 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:41,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-03 16:27:41,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:41,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:41,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:42,640 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 16:27:42,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:42,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:42,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27: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 16:27:42,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27: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 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 16:27:42,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:42,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:42,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:42,708 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 16:27:42,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:45,753 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 16:27:45,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:45,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:27:45,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:45,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:27:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:27:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:27:45,773 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 16:27:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:45,876 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 16:27:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:27:45,877 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 16:27:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:45,877 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:27:45,877 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:27:45,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:27:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:27:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:27:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:27:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 16:27:45,880 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 16:27:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:45,881 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 16:27:45,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:27:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 16:27:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:27:45,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:45,881 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 16:27:45,882 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:45,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-03 16:27:45,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:45,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:45,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:47,259 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 16:27:47,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:47,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:47,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:47,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:47,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:47,260 INFO 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 16:27:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:47,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:47,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:27:47,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:47,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:47,544 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 16:27:47,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:50,577 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 16:27:50,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:50,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:27:50,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:50,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:27:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:27:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:27:50,598 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 16:27:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:50,666 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 16:27:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:27:50,666 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 16:27:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:50,667 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:27:50,667 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:27:50,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:27:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:27:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:27:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:27:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 16:27:50,670 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 16:27:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:50,670 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 16:27:50,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:27:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 16:27:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:27:50,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:50,671 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 16:27:50,671 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:50,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-03 16:27:50,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:50,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:50,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:50,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:50,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:53,588 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 16:27:53,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:53,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:53,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:53,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:53,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:53,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:27:53,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:53,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:53,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:53,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:53,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:53,662 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 16:27:53,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:56,885 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 16:27:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:56,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:27:56,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:56,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:27:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:27:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:27:56,905 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 16:27:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:56,995 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:27:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:27:56,996 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 16:27:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:56,997 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:27:56,997 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:27:56,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:27:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:27:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:27:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:27:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 16:27:56,999 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 16:27:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:56,999 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 16:27:56,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:27:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 16:27:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:27:56,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:57,000 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 16:27:57,000 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:57,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-03 16:27:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:57,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:57,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:58,725 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 16:27:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:58,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:58,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,726 INFO 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 16:27:58,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:58,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:58,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:58,790 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 16:27:58,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:02,136 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 16:28:02,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:02,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:28:02,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:02,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:28:02,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:28:02,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:28:02,158 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 16:28:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:02,266 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 16:28:02,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:28:02,267 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 16:28:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:02,267 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:28:02,268 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:28:02,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:28:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:28:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:28:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:28:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 16:28:02,271 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 16:28:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:02,271 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 16:28:02,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:28:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 16:28:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:28:02,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:02,272 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 16:28:02,272 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:02,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-03 16:28:02,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:02,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:04,061 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 16:28:04,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:04,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:04,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:04,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:04,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:04,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:28:04,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:04,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:04,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:28:04,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:04,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:04,387 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 16:28:04,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:08,149 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 16:28:08,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:28:08,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:08,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:28:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:28:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:28:08,171 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 16:28:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:08,247 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 16:28:08,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:28:08,247 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 16:28:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:08,248 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:28:08,248 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:28:08,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:28:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:28:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:28:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:28:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 16:28:08,252 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 16:28:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:08,253 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 16:28:08,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:28:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 16:28:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:28:08,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:08,253 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 16:28:08,254 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:08,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:08,254 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-03 16:28:08,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:08,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:08,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:09,576 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 16:28:09,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:09,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:09,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:09,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:09,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:09,576 INFO 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 16:28:09,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:09,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:09,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:09,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:09,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:09,666 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 16:28:09,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:14,561 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 16:28:14,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:14,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:28:14,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:14,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:28:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:28:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:28:14,582 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 16:28:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:14,686 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 16:28:14,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:28:14,687 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 16:28:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:14,688 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:28:14,688 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:28:14,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:28:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:28:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:28:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:28:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 16:28:14,691 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 16:28:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:14,692 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 16:28:14,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:28:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 16:28:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 16:28:14,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:14,693 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 16:28:14,693 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:14,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-03 16:28:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:14,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:14,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:16,338 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 16:28:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:16,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:16,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:16,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:16,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:16,339 INFO 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 16:28:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:16,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:16,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:16,415 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 16:28:16,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:20,597 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 16:28:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:20,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:28:20,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:20,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:28:20,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:28:20,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:28:20,619 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 16:28:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:20,708 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:28:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:28:20,709 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 16:28:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:20,709 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:28:20,710 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:28:20,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:28:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:28:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:28:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:28:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 16:28:20,713 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 16:28:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:20,713 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 16:28:20,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:28:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 16:28:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:28:20,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:20,713 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 16:28:20,713 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:20,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-03 16:28:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:20,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:20,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:20,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:22,046 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 16:28:22,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:22,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:22,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:22,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:22,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:22,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:28:22,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:22,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:22,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:28:22,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:22,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:22,429 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 16:28:22,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:26,546 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 16:28:26,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:26,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:28:26,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:26,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:28:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:28:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:28:26,569 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 16:28:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:26,649 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 16:28:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:28:26,649 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 16:28:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:26,650 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:28:26,650 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:28:26,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:28:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:28:26,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:28:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:28:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 16:28:26,652 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 16:28:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:26,653 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 16:28:26,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:28:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 16:28:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:28:26,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:26,654 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 16:28:26,654 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:26,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:26,654 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-03 16:28:26,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:26,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:26,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:28,162 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 16:28:28,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:28,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:28,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:28,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 16:28:28,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:28,163 INFO 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 16:28:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:28,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:28,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:28,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:28,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:28,243 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 16:28:28,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:32,262 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 16:28:32,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:32,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:28:32,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:32,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:28:32,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:28:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:28:32,284 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 16:28:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:32,420 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 16:28:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:28:32,420 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 16:28:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:32,420 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:28:32,421 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:28:32,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:28:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:28:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:28:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:28:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 16:28:32,424 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 16:28:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:32,425 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 16:28:32,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:28:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 16:28:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:28:32,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:32,425 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 16:28:32,425 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:32,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-03 16:28:32,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:32,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:32,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:32,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:32,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:34,291 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 16:28:34,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:34,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:34,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:34,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:34,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:34,292 INFO 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 16:28:34,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:34,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:34,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:34,363 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 16:28:34,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:38,545 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 16:28:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:28:38,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:38,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:28:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:28:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:28:38,566 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 16:28:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:38,733 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 16:28:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:28:38,733 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 16:28:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:38,734 INFO L225 Difference]: With dead ends: 68 [2018-12-03 16:28:38,734 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:28:38,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:28:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:28:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:28:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:28:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 16:28:38,736 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 16:28:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:38,736 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 16:28:38,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:28:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 16:28:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:28:38,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:38,737 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 16:28:38,737 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:38,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-03 16:28:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:38,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:38,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:40,287 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 16:28:40,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:40,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:40,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:40,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:40,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:40,288 INFO 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 16:28:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:40,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:40,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:28:40,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:40,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:40,713 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 16:28:40,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:45,215 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 16:28:45,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:28:45,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:45,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:28:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:28:45,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:28:45,236 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 16:28:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:45,354 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:28:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:28:45,354 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 16:28:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:45,355 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:28:45,355 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:28:45,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:28:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:28:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:28:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:28:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 16:28:45,358 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 16:28:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:45,358 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 16:28:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:28:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 16:28:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:28:45,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:45,359 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 16:28:45,359 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-03 16:28:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:45,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:45,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:46,956 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 16:28:46,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:46,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:46,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:46,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:46,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:46,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:28:46,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:46,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:47,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:47,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:47,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:47,046 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 16:28:47,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:51,701 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 16:28:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:28:51,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:51,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:28:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:28:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:28:51,721 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 16:28:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:51,835 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 16:28:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:28:51,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 16:28:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:51,844 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:28:51,844 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:28:51,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:28:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:28:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:28:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:28:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 16:28:51,847 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 16:28:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:51,847 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 16:28:51,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:28:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 16:28:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:28:51,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:51,848 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 16:28:51,848 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:51,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-03 16:28:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:51,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:51,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:53,444 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 16:28:53,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:53,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:53,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:53,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 16:28:53,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:53,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 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 16:28:53,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:53,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:53,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:53,527 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 16:28:53,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:58,170 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 16:28:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:58,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:28:58,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:58,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:28:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:28:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:28:58,191 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 16:28:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:58,277 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 16:28:58,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:28:58,278 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 16:28:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:58,278 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:28:58,278 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:28:58,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:28:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:28:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:28:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:28:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 16:28:58,280 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 16:28:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:58,281 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 16:28:58,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:28:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 16:28:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:28:58,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:58,282 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 16:28:58,282 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:58,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-03 16:28:58,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:58,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:58,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:00,862 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 16:29:00,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:00,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:00,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:00,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:00,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:00,863 INFO 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 16:29:00,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:00,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:01,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:29:01,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:01,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:01,377 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 16:29:01,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:06,180 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 16:29:06,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:06,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:29:06,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:06,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:29:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:29:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:29:06,203 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 16:29:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:06,311 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 16:29:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:29:06,311 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 16:29:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:06,312 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:29:06,312 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:29:06,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:29:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:29:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:29:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:29:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 16:29:06,315 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 16:29:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:06,315 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 16:29:06,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:29:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 16:29:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:29:06,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:06,315 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 16:29:06,316 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:06,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-03 16:29:06,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:06,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:06,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:06,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:07,917 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 16:29:07,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:07,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:07,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:07,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:07,918 INFO 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 16:29:07,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:07,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:08,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:08,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:08,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:08,022 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 16:29:08,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:13,800 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 16:29:13,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:13,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:29:13,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:13,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:29:13,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:29:13,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:29:13,821 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 16:29:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:14,125 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:29:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:29:14,125 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 16:29:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:14,125 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:29:14,125 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:29:14,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:29:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:29:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:29:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:29:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 16:29:14,129 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 16:29:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:14,129 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 16:29:14,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:29:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 16:29:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:29:14,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:14,130 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 16:29:14,130 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:14,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-03 16:29:14,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:14,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:14,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:16,103 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 16:29:16,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:16,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:16,103 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:16,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:16,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:16,104 INFO 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 16:29:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:16,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:16,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:16,188 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 16:29:16,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:21,294 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 16:29:21,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:21,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:29:21,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:21,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:29:21,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:29:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:29:21,316 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 16:29:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:21,406 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 16:29:21,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:29:21,407 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 16:29:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:21,408 INFO L225 Difference]: With dead ends: 74 [2018-12-03 16:29:21,408 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:29:21,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:29:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:29:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:29:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:29:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 16:29:21,411 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 16:29:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:21,411 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 16:29:21,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:29:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 16:29:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:29:21,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:21,412 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 16:29:21,412 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-03 16:29:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:21,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:21,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:23,149 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 16:29:23,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:23,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:23,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:23,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:23,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:23,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:29:23,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:23,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:23,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:29:23,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:23,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:23,715 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 16:29:23,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:28,850 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 16:29:28,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:28,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:29:28,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:28,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:29:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:29:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:29:28,872 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 16:29:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:29,059 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 16:29:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:29:29,060 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 16:29:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:29,060 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:29:29,060 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:29:29,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:29:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:29:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:29:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:29:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 16:29:29,064 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 16:29:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:29,064 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 16:29:29,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:29:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 16:29:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:29:29,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:29,065 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 16:29:29,065 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:29,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:29,065 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-03 16:29:29,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:29,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:29,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:31,179 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 16:29:31,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:31,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:31,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:31,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:31,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:31,179 INFO 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 16:29:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:31,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:31,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:31,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:31,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:31,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:36,602 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 16:29:36,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:36,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:29:36,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:36,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:29:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:29:36,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:29:36,622 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 16:29:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:36,752 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 16:29:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:29:36,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 16:29:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:36,753 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:29:36,753 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:29:36,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:29:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:29:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:29:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:29:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 16:29:36,757 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 16:29:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:36,757 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 16:29:36,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:29:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 16:29:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:29:36,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:36,758 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 16:29:36,758 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:36,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-03 16:29:36,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:36,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:36,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:39,015 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 16:29:39,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:39,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:39,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:39,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:39,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:39,015 INFO 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 16:29:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:39,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:39,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:39,095 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 16:29:39,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:44,620 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 16:29:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:44,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:29:44,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:44,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:29:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:29:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:29:44,642 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 16:29:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:44,775 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:29:44,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:29:44,776 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 16:29:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:44,777 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:29:44,777 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:29:44,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:29:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:29:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:29:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:29:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 16:29:44,781 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 16:29:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:44,781 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 16:29:44,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:29:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 16:29:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:29:44,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:44,782 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 16:29:44,782 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:44,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-03 16:29:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:44,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:47,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:47,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:47,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:47,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:47,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:47,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:29:47,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:47,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:47,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:53,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:53,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:29:53,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:53,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:29:53,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:29:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:29:53,452 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 16:29:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:53,598 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 16:29:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:29:53,598 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 16:29:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:53,599 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:29:53,599 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:29:53,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:29:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:29:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:29:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:29:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:29:53,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 16:29:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:53,603 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:29:53,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:29:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:29:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:29:53,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:53,604 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 16:29:53,604 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:53,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-03 16:29:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:53,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:53,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:55,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:55,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:55,862 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:55,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:55,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:55,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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:55,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:55,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:55,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:55,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:55,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:55,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:01,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:01,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:30:01,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:01,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:30:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:30:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:30:01,988 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 16:30:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:02,153 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:30:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:30:02,153 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 16:30:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:02,154 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:30:02,154 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:30:02,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:30:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:30:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:30:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:30:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 16:30:02,157 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 16:30:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:02,157 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 16:30:02,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:30:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 16:30:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:30:02,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:02,158 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 16:30:02,158 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:02,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-03 16:30:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:02,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:02,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:04,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:04,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:04,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:04,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:04,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:04,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:04,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:04,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:04,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:04,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:10,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:30:10,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:10,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:30:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:30:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:30:10,391 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 16:30:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:10,580 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 16:30:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:30:10,580 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 16:30:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:10,581 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:30:10,581 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:30:10,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:30:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:30:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:30:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:30:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:30:10,585 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 16:30:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:10,585 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:30:10,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:30:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:30:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:30:10,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:10,586 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 16:30:10,586 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:10,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-03 16:30:10,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:10,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:12,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:12,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:12,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:12,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:12,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:12,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:12,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:12,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:13,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:30:13,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:13,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:13,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:20,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:20,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:30:20,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:20,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:30:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:30:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:30:20,151 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 16:30:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:20,265 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:30:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:30:20,266 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 16:30:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:20,266 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:30:20,266 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:30:20,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:30:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:30:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:30:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:30:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 16:30:20,270 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 16:30:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:20,271 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 16:30:20,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:30:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 16:30:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:30:20,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:20,271 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 16:30:20,272 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:20,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-03 16:30:20,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:20,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:20,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:22,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:22,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:22,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:22,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:22,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:22,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:22,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:22,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:22,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:22,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:22,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:29,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:30:29,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:29,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:30:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:30:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:30:29,295 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 16:30:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:29,412 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 16:30:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:30:29,413 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 16:30:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:29,414 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:30:29,414 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:30:29,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:30:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:30:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:30:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:30:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 16:30:29,417 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 16:30:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:29,418 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 16:30:29,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:30:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 16:30:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:30:29,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:29,418 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 16:30:29,419 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:29,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-03 16:30:29,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:29,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:29,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:31,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:31,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:31,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:31,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:31,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:31,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:31,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:31,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:31,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:38,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:38,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:30:38,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:38,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:30:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:30:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:30:38,303 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 16:30:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:38,724 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 16:30:38,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:30:38,724 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 16:30:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:38,725 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:30:38,725 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:30:38,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:30:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:30:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:30:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:30:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 16:30:38,727 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 16:30:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:38,728 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 16:30:38,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:30:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 16:30:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:30:38,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:38,728 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 16:30:38,729 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:38,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-03 16:30:38,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:38,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:38,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:41,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:41,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:41,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:41,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:41,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:41,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:41,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:41,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:42,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:30:42,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:42,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:42,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:48,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:48,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:30:48,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:48,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:30:48,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:30:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:30:48,805 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 16:30:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:49,455 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 16:30:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:30:49,455 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 16:30:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:49,456 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:30:49,456 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:30:49,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:30:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:30:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:30:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:30:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 16:30:49,460 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 16:30:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:49,460 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 16:30:49,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:30:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 16:30:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:30:49,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:49,461 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 16:30:49,461 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:49,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-03 16:30:49,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:49,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:49,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:49,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:49,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:52,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:52,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:52,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:52,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:52,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:52,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:52,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:52,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:52,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:52,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:52,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:52,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:59,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:59,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:30:59,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:59,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:30:59,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:30:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:30:59,234 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 16:30:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:59,379 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:30:59,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:30:59,379 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 16:30:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:59,380 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:30:59,380 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:30:59,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:30:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:30:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:30:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:30:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 16:30:59,383 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 16:30:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:59,383 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 16:30:59,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:30:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 16:30:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:30:59,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:59,384 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 16:30:59,384 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:59,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-03 16:30:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:59,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:59,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:59,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:02,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:02,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:02,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:02,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:02,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:02,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:02,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:02,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:09,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:09,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:31:09,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:09,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:31:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:31:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:31:09,330 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 16:31:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:09,450 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 16:31:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:31:09,451 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 16:31:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:09,452 INFO L225 Difference]: With dead ends: 86 [2018-12-03 16:31:09,452 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:31:09,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:31:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:31:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:31:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:31:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 16:31:09,455 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 16:31:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:09,455 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 16:31:09,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:31:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 16:31:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:31:09,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:09,456 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 16:31:09,456 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:09,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-03 16:31:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:09,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:09,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:11,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:11,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:11,784 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:11,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:11,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:11,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:11,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:12,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:31:12,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:12,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:12,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:20,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:20,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:31:20,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:20,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:31:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:31:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:31:20,123 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 16:31:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:20,310 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 16:31:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:31:20,310 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 16:31:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:20,310 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:31:20,310 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:31:20,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:31:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:31:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:31:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:31:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 16:31:20,313 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 16:31:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:20,313 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 16:31:20,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:31:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 16:31:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:31:20,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:20,314 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 16:31:20,314 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:20,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-03 16:31:20,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:20,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:20,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:20,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:20,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:23,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:23,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:23,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:23,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 16:31:23,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:23,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:23,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:23,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:23,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:23,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:23,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:23,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:30,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:30,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:31:30,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:30,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:31:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:31:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:31:30,652 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 16:31:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:30,827 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 16:31:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:31:30,828 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 16:31:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:30,828 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:31:30,828 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:31:30,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:31:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:31:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:31:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:31:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 16:31:30,831 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 16:31:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:30,831 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 16:31:30,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:31:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 16:31:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:31:30,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:30,832 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 16:31:30,832 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:30,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-03 16:31:30,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:30,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:30,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:30,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:30,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:33,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:33,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:33,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:33,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:33,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:33,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:33,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:33,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:33,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:33,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:41,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:31:41,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:41,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:31:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:31:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:31:41,423 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 16:31:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:41,669 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:31:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:31:41,669 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 16:31:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:41,670 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:31:41,670 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:31:41,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:31:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:31:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:31:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:31:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 16:31:41,673 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 16:31:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:41,673 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 16:31:41,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:31:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 16:31:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:31:41,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:41,673 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 16:31:41,674 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:41,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-03 16:31:41,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:41,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:41,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:44,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:44,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:44,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:44,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:44,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:44,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:44,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:44,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:45,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:31:45,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:45,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:45,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:53,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:53,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:31:53,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:53,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:31:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:31:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:31:53,330 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 16:31:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:53,504 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 16:31:53,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:31:53,505 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 16:31:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:53,505 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:31:53,505 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:31:53,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:31:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:31:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:31:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:31:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 16:31:53,508 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 16:31:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:53,509 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 16:31:53,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:31:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 16:31:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:31:53,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:53,509 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 16:31:53,509 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:53,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-03 16:31:53,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:53,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:53,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:53,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:53,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:56,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:56,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:56,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:56,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:56,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:56,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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:56,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:56,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:56,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:56,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:56,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:56,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:04,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:04,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:32:04,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:04,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:32:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:32:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:32:04,317 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 16:32:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:04,506 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 16:32:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:32:04,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 16:32:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:04,507 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:32:04,507 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:32:04,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:32:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:32:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:32:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:32:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 16:32:04,511 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 16:32:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:04,511 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 16:32:04,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:32:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 16:32:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:32:04,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:04,512 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 16:32:04,512 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:04,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-03 16:32:04,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:04,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:04,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:07,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:07,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:07,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:07,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 16:32:07,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:07,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:07,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:07,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:07,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:07,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:15,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:15,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:32:15,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:15,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:32:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:32:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:32:15,642 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 16:32:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:16,006 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 16:32:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:32:16,006 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 16:32:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:16,007 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:32:16,007 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:32:16,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:32:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:32:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:32:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:32:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 16:32:16,010 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 16:32:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:16,010 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 16:32:16,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:32:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 16:32:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:32:16,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:16,011 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 16:32:16,011 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:16,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-03 16:32:16,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:16,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:18,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:18,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:18,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:18,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:18,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:18,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:18,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:20,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:32:20,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:20,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:20,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:28,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:32:28,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:32:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:32:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:32:28,475 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 16:32:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:28,700 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:32:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:32:28,700 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 16:32:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:28,701 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:32:28,701 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:32:28,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:32:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:32:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:32:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:32:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 16:32:28,705 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 16:32:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:28,705 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 16:32:28,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:32:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 16:32:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:32:28,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:28,706 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 16:32:28,706 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:28,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-03 16:32:28,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:28,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:28,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:31,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:31,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:31,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:31,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:31,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:31,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:31,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:31,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:31,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:31,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:31,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:31,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:40,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:40,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:32:40,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:40,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:32:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:32:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:32:40,242 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 16:32:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:40,376 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 16:32:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:32:40,379 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 16:32:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:40,379 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:32:40,379 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:32:40,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:32:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:32:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:32:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:32:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 16:32:40,398 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 16:32:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:40,398 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 16:32:40,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:32:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 16:32:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:32:40,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:40,399 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 16:32:40,399 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:40,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-03 16:32:40,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:40,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:40,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:43,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:43,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:43,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:43,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:43,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:43,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:43,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:43,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:43,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:43,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:52,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:32:52,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:52,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:32:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:32:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:32:52,256 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 16:32:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:52,493 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 16:32:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:32:52,494 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 16:32:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:52,494 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:32:52,494 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:32:52,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:32:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:32:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:32:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:32:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 16:32:52,498 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 16:32:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:52,498 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 16:32:52,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:32:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 16:32:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:32:52,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:52,498 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 16:32:52,498 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:52,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:52,499 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-03 16:32:52,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:52,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:55,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:55,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:55,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:55,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:55,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:55,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:55,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:55,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:57,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:32:57,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:57,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:57,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:06,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:06,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:33:06,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:06,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:33:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:33:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:33:06,097 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 16:33:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:06,234 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 16:33:06,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:33:06,234 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 16:33:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:06,235 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:33:06,235 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:33:06,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:33:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:33:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:33:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:33:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 16:33:06,238 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 16:33:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:06,238 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 16:33:06,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:33:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 16:33:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:33:06,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:06,239 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 16:33:06,239 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:06,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-03 16:33:06,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:06,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:06,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:09,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:09,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:09,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:09,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:09,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:09,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:09,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:09,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:09,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:09,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:09,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:09,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:18,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:33:18,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:18,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:33:18,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:33:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:33:18,542 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 16:33:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:18,789 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:33:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:33:18,789 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 16:33:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:18,790 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:33:18,790 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:33:18,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:33:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:33:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:33:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:33:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 16:33:18,794 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 16:33:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:18,794 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 16:33:18,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:33:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 16:33:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:33:18,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:18,795 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 16:33:18,795 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:18,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-03 16:33:18,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:18,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:18,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:22,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:22,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:22,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:22,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:22,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:22,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:22,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:22,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:22,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:22,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:31,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:31,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:33:31,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:31,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:33:31,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:33:31,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:33:31,711 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 16:33:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:31,904 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 16:33:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:33:31,904 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 16:33:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:31,904 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:33:31,905 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:33:31,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:33:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:33:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:33:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:33:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 16:33:31,907 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 16:33:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:31,908 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 16:33:31,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:33:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 16:33:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:33:31,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:31,908 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 16:33:31,908 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:31,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-03 16:33:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:31,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:31,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:35,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:35,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:35,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:35,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 16:33:35,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:35,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:35,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:35,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:36,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:33:36,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:36,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:36,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:46,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:46,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:33:46,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:46,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:33:46,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:33:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:33:46,268 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 16:33:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:46,417 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 16:33:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:33:46,417 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 16:33:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:46,418 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:33:46,418 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:33:46,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:33:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:33:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:33:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:33:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 16:33:46,421 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 16:33:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:46,421 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 16:33:46,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:33:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 16:33:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:33:46,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:46,422 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 16:33:46,422 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:46,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:46,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-03 16:33:46,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:46,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:46,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:49,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:49,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:49,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:49,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:49,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:49,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:49,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:49,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:49,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:49,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:49,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:49,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:59,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:59,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:33:59,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:59,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:33:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:33:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:33:59,536 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 16:33:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:59,710 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 16:33:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:33:59,711 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 16:33:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:59,712 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:33:59,712 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:33:59,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:33:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:33:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:33:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:33:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 16:33:59,714 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 16:33:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:59,715 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 16:33:59,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:33:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 16:33:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:33:59,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:59,715 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 16:33:59,715 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:59,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-03 16:33:59,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:59,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:59,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:03,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:03,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:03,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:03,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:03,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:03,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:03,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:03,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:03,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:13,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:34:13,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:13,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:34:13,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:34:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:34:13,421 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 16:34:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:13,584 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:34:13,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:34:13,585 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 16:34:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:13,586 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:34:13,586 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:34:13,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:34:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:34:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:34:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:34:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 16:34:13,590 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 16:34:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:13,590 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 16:34:13,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:34:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 16:34:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:34:13,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:13,591 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 16:34:13,592 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:13,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-03 16:34:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:13,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:13,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:17,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:17,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:17,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:17,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 16:34:17,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:17,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:17,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:17,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:18,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:34:18,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:18,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:19,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:29,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:29,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 16:34:29,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:29,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:34:29,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:34:29,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:34:29,230 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 16:34:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:29,399 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 16:34:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:34:29,400 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 16:34:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:29,401 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:34:29,401 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:34:29,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:34:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:34:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:34:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:34:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 16:34:29,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 16:34:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:29,406 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 16:34:29,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:34:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 16:34:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:34:29,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:29,407 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 16:34:29,407 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:29,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-03 16:34:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:29,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:29,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:33,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:33,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:33,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:33,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:33,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:33,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:33,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:33,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:33,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:33,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:33,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:33,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:43,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:43,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 16:34:43,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:43,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 16:34:43,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 16:34:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:34:43,544 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 16:34:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:43,773 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 16:34:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:34:43,773 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 16:34:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:43,774 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:34:43,774 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:34:43,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:34:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:34:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:34:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:34:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 16:34:43,778 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 16:34:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:43,778 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 16:34:43,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 16:34:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 16:34:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:34:43,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:43,779 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 16:34:43,779 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:43,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-03 16:34:43,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:43,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:43,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:47,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:47,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:47,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:47,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:47,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:47,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:47,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:47,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:47,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:47,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:58,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:58,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 16:34:58,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:58,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:34:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:34:58,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:34:58,355 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 16:34:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:58,662 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 16:34:58,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:34:58,662 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 16:34:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:58,663 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:34:58,663 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:34:58,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:34:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:34:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:34:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:34:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 16:34:58,667 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 16:34:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:58,667 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 16:34:58,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:34:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 16:34:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:34:58,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:58,668 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 16:34:58,668 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:58,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-03 16:34:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:58,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:02,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:02,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:02,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:02,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 16:35:02,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:02,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:02,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:04,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:35:04,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:04,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:04,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:14,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:14,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 16:35:14,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:14,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:35:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:35:14,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:35:14,960 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 16:35:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:15,213 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:35:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:35:15,213 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 16:35:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:15,214 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:35:15,214 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:35:15,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:35:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:35:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:35:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:35:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 16:35:15,217 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 16:35:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:15,217 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 16:35:15,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:35:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 16:35:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:35:15,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:15,218 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 16:35:15,218 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:15,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-03 16:35:15,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:15,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:15,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:19,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:19,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:19,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:19,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:19,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:35:19,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:35:19,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:35:19,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:19,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:19,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:30,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 16:35:30,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:30,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:35:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:35:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:35:30,175 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 16:35:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:30,452 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 16:35:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:35:30,452 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 16:35:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:30,453 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:35:30,453 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:35:30,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:35:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:35:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:35:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:35:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 16:35:30,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 16:35:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:30,458 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 16:35:30,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:35:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 16:35:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:35:30,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:30,459 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 16:35:30,459 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:30,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-03 16:35:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:30,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:30,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:34,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:34,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:34,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:34,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:34,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:34,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:34,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:34,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:34,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:45,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:45,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 16:35:45,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:45,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:35:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:35:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:35:45,731 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 16:35:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:45,914 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 16:35:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:35:45,915 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 16:35:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:45,916 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:35:45,916 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:35:45,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:35:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:35:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:35:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:35:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 16:35:45,920 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 16:35:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:45,920 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 16:35:45,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:35:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 16:35:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:35:45,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:45,921 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 16:35:45,921 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:45,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-03 16:35:45,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:45,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:45,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:49,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:49,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:49,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:49,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:49,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:49,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:49,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:49,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:52,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:35:52,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:52,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:52,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:03,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:03,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 16:36:03,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:03,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:36:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:36:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:36:03,707 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 16:36:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:04,102 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 16:36:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:36:04,102 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 16:36:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:04,103 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:36:04,103 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:36:04,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:36:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:36:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:36:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:36:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 16:36:04,107 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 16:36:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:04,107 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 16:36:04,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:36:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 16:36:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:36:04,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:04,108 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 16:36:04,108 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:04,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-03 16:36:04,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:04,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:04,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:07,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:07,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:07,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:07,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 16:36:07,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:07,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:07,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:36:07,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:36:08,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:36:08,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:08,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:08,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:20,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:20,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 16:36:20,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:20,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:36:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:36:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:36:20,085 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 16:36:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:20,386 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:36:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:36:20,387 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 16:36:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:20,387 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:36:20,388 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:36:20,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:36:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:36:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:36:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:36:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 16:36:20,392 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 16:36:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:20,392 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 16:36:20,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:36:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 16:36:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:36:20,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:20,393 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 16:36:20,393 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:20,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-03 16:36:20,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:20,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:20,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:20,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:20,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:24,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:24,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:24,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:24,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:24,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:24,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:24,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:24,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:36:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:24,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:24,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:36,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:36,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:36:36,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:36,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:36:36,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:36:36,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:36:36,398 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 16:36:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:36,646 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 16:36:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:36:36,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 16:36:36,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:36,647 INFO L225 Difference]: With dead ends: 110 [2018-12-03 16:36:36,647 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:36:36,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:36:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:36:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:36:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:36:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 16:36:36,650 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 16:36:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:36,651 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 16:36:36,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:36:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 16:36:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:36:36,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:36,651 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 16:36:36,651 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:36,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-03 16:36:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:36,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:40,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:40,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:40,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:40,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:40,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:40,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:40,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:43,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:36:43,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:43,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:43,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:55,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:55,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 16:36:55,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:55,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:36:55,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:36:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:36:55,733 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 16:36:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:55,964 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 16:36:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:36:55,964 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 16:36:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:55,964 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:36:55,964 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:36:55,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:36:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:36:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:36:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:36:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 16:36:55,968 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 16:36:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:55,968 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 16:36:55,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:36:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 16:36:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:36:55,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:55,969 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 16:36:55,969 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:55,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-03 16:36:55,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:55,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:55,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:59,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:59,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:59,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:59,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:59,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:59,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:59,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:36:59,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:00,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:00,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:00,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:00,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:12,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:12,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 16:37:12,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:12,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:37:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:37:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:37:12,505 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 16:37:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:12,763 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 16:37:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:37:12,763 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 16:37:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:12,764 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:37:12,764 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:37:12,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:37:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:37:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:37:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:37:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 16:37:12,768 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 16:37:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:12,768 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 16:37:12,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:37:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 16:37:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:37:12,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:12,769 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 16:37:12,769 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:12,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-03 16:37:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:12,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:12,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:17,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:17,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:17,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:17,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:17,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:17,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:17,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:17,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:17,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:29,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:29,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 16:37:29,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:29,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 16:37:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 16:37:29,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:37:29,853 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 16:37:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:30,116 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 16:37:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:37:30,117 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 16:37:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:30,117 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:37:30,117 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:37:30,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:37:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:37:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:37:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:37:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 16:37:30,121 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 16:37:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:30,121 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 16:37:30,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 16:37:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 16:37:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:37:30,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:30,122 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 16:37:30,123 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:30,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-03 16:37:30,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:30,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:30,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:30,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:34,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:34,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:34,641 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:34,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:34,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:34,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:34,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:34,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:37,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:37:37,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:37,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:37,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:50,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:50,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 16:37:50,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:50,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:37:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:37:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:37:50,324 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 16:37:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:50,676 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 16:37:50,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:37:50,676 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 16:37:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:50,677 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:37:50,677 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:37:50,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:37:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:37:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:37:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:37:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 16:37:50,680 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 16:37:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:50,680 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 16:37:50,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:37:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 16:37:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:37:50,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:50,681 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 16:37:50,681 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:50,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-03 16:37:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:50,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:50,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:55,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:55,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:55,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:55,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:55,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:55,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:55,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:55,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:55,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:55,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:55,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:55,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:08,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:08,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 16:38:08,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:08,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 16:38:08,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 16:38:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:38:08,517 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 16:38:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:08,791 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 16:38:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:38:08,796 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 16:38:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:08,797 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:38:08,797 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:38:08,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:38:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:38:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:38:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:38:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 16:38:08,801 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 16:38:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:08,801 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 16:38:08,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 16:38:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 16:38:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:38:08,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:08,802 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 16:38:08,802 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:08,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-03 16:38:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:08,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:08,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:08,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:13,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:13,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:13,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:13,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:13,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:13,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:13,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:13,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:13,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:13,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:26,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:26,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 16:38:26,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:26,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:38:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:38:26,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:38:26,759 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 16:38:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:26,991 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 16:38:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:38:26,991 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 16:38:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:26,992 INFO L225 Difference]: With dead ends: 116 [2018-12-03 16:38:26,992 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:38:26,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:38:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:38:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:38:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:38:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 16:38:26,996 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 16:38:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:26,996 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 16:38:26,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:38:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 16:38:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:38:26,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:26,997 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 16:38:26,997 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:26,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-03 16:38:26,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:26,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:31,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:31,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:31,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:31,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:31,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:31,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)