java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:23:51,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:23:51,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:23:51,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:23:51,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:23:51,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:23:51,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:23:51,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:23:51,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:23:51,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:23:51,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:23:51,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:23:51,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:23:51,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:23:51,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:23:51,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:23:51,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:23:51,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:23:51,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:23:51,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:23:51,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:23:51,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:23:51,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:23:51,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:23:51,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:23:51,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:23:51,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:23:51,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:23:51,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:23:51,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:23:51,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:23:51,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:23:51,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:23:51,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:23:51,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:23:51,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:23:51,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:23:51,228 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:23:51,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:23:51,229 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:23:51,229 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:23:51,230 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:23:51,232 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:23:51,232 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:23:51,232 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:23:51,233 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:23:51,233 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:23:51,233 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:23:51,233 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:23:51,234 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:23:51,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:23:51,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:23:51,235 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:23:51,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:23:51,235 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:23:51,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:23:51,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:23:51,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:23:51,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:23:51,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:23:51,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:23:51,238 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:23:51,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:23:51,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:23:51,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:23:51,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:23:51,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:23:51,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:23:51,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:23:51,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:23:51,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:23:51,240 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:23:51,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:23:51,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:23:51,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:23:51,241 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:23:51,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:23:51,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:23:51,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:23:51,293 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:23:51,294 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:23:51,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-01-20 10:23:51,295 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-20 10:23:51,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:23:51,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:23:51,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:23:51,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:23:51,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:23:51,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:23:51,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:23:51,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:23:51,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:23:51,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (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 [2019-01-20 10:23:51,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:23:51,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:23:51,687 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:23:51,687 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-20 10:23:51,688 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51 BoogieIcfgContainer [2019-01-20 10:23:51,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:23:51,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:23:51,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:23:51,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:23:51,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/2) ... [2019-01-20 10:23:51,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e60d7ab and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:51, skipping insertion in model container [2019-01-20 10:23:51,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51" (2/2) ... [2019-01-20 10:23:51,697 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-20 10:23:51,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:23:51,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 10:23:51,733 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 10:23:51,766 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:23:51,767 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:23:51,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:23:51,767 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:23:51,767 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:23:51,767 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:23:51,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:23:51,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:23:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-20 10:23:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:23:51,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:51,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:23:51,794 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-20 10:23:51,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:51,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:51,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:51,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:23:51,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:23:51,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:23:51,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:23:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:23:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:23:51,963 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-20 10:23:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:52,011 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-20 10:23:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:23:52,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:23:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:52,033 INFO L225 Difference]: With dead ends: 9 [2019-01-20 10:23:52,034 INFO L226 Difference]: Without dead ends: 5 [2019-01-20 10:23:52,040 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 [2019-01-20 10:23:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-20 10:23:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-20 10:23:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-20 10:23:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-20 10:23:52,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-20 10:23:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:52,073 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-20 10:23:52,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:23:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-20 10:23:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:23:52,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:52,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:23:52,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-20 10:23:52,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:52,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:52,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:52,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:23:52,258 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-20 10:23:52,349 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:23:52,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:23:53,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:23:53,588 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:23:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:53,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:23:53,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:53,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:53,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:53,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:53,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:53,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:53,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-20 10:23:53,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:53,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:23:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:23:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:23:53,961 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-20 10:23:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:54,011 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-20 10:23:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:23:54,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:23:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:54,013 INFO L225 Difference]: With dead ends: 8 [2019-01-20 10:23:54,013 INFO L226 Difference]: Without dead ends: 6 [2019-01-20 10:23:54,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:23:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-20 10:23:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-20 10:23:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 10:23:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-20 10:23:54,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-20 10:23:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:54,018 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-20 10:23:54,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:23:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-20 10:23:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:23:54,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:54,020 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:23:54,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-20 10:23:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:54,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:54,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:54,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:54,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:54,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:54,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:54,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:54,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:23:54,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:54,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-20 10:23:54,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:54,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:23:54,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:23:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:23:54,279 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-20 10:23:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:54,303 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-20 10:23:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:23:54,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-20 10:23:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:54,305 INFO L225 Difference]: With dead ends: 9 [2019-01-20 10:23:54,305 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 10:23:54,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:23:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 10:23:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 10:23:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 10:23:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-20 10:23:54,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-20 10:23:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:54,309 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-20 10:23:54,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:23:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-20 10:23:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:23:54,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:54,310 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 10:23:54,310 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-20 10:23:54,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:54,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:54,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:54,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:54,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:54,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:54,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:54,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:54,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:54,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:54,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:54,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 10:23:54,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:54,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:23:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:23:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:23:54,741 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-20 10:23:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:54,762 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-20 10:23:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:23:54,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-20 10:23:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:54,763 INFO L225 Difference]: With dead ends: 10 [2019-01-20 10:23:54,763 INFO L226 Difference]: Without dead ends: 8 [2019-01-20 10:23:54,764 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 [2019-01-20 10:23:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-20 10:23:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-20 10:23:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 10:23:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-20 10:23:54,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-20 10:23:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:54,767 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-20 10:23:54,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:23:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-20 10:23:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:23:54,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:54,768 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-20 10:23:54,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-20 10:23:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:54,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:54,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:55,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:55,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:55,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:55,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:55,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:55,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-20 10:23:55,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:55,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:23:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:23:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:23:55,251 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-20 10:23:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:55,295 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-20 10:23:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:23:55,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:23:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:55,297 INFO L225 Difference]: With dead ends: 11 [2019-01-20 10:23:55,297 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 10:23:55,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:23:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 10:23:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 10:23:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:23:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-20 10:23:55,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-20 10:23:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:55,300 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-20 10:23:55,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:23:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-20 10:23:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:23:55,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:55,300 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-20 10:23:55,300 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-20 10:23:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:55,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:55,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:55,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:55,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:55,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:55,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:23:55,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:55,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:56,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-20 10:23:56,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:56,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:23:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:23:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:23:56,067 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-20 10:23:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:56,112 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-20 10:23:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:23:56,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-20 10:23:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:56,113 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:23:56,113 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 10:23:56,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:23:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 10:23:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-20 10:23:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 10:23:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-20 10:23:56,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-20 10:23:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:56,116 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-20 10:23:56,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:23:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-20 10:23:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:23:56,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:56,117 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-20 10:23:56,117 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-20 10:23:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:56,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:56,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:56,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:56,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:56,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:56,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:56,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:56,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:56,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:56,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:56,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-20 10:23:56,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:56,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:23:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:23:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:23:56,556 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-20 10:23:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:56,596 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-20 10:23:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:23:56,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-20 10:23:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:56,598 INFO L225 Difference]: With dead ends: 13 [2019-01-20 10:23:56,598 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:23:56,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:23:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:23:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 10:23:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:23:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-20 10:23:56,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-20 10:23:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:56,602 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-20 10:23:56,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:23:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-20 10:23:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:23:56,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:56,603 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-20 10:23:56,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-20 10:23:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:56,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:56,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:56,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:56,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:56,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:56,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:56,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:56,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:57,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-20 10:23:57,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:23:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:23:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:23:57,133 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-20 10:23:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:57,161 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-20 10:23:57,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:23:57,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-20 10:23:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:57,164 INFO L225 Difference]: With dead ends: 14 [2019-01-20 10:23:57,164 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:23:57,165 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 [2019-01-20 10:23:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:23:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 10:23:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:23:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-20 10:23:57,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-20 10:23:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:57,168 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-20 10:23:57,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:23:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-20 10:23:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 10:23:57,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:57,169 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-20 10:23:57,169 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-20 10:23:57,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:57,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:57,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:57,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:57,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:57,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:57,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 10:23:57,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:57,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:57,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-20 10:23:57,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:57,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:23:57,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:23:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:23:57,640 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-20 10:23:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:57,667 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-20 10:23:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:23:57,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-20 10:23:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:57,668 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:23:57,669 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 10:23:57,669 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 [2019-01-20 10:23:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 10:23:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 10:23:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:23:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-20 10:23:57,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-20 10:23:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:57,671 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-20 10:23:57,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:23:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-20 10:23:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 10:23:57,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:57,672 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-20 10:23:57,672 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-20 10:23:57,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:57,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:57,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:57,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:57,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:57,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:57,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:57,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:57,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:58,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-20 10:23:58,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:58,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:23:58,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:23:58,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:23:58,012 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-20 10:23:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:58,038 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-20 10:23:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:23:58,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-20 10:23:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:58,040 INFO L225 Difference]: With dead ends: 16 [2019-01-20 10:23:58,040 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 10:23:58,041 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 [2019-01-20 10:23:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 10:23:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-20 10:23:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:23:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-20 10:23:58,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-20 10:23:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:58,048 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-20 10:23:58,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:23:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-20 10:23:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-20 10:23:58,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:58,048 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-20 10:23:58,048 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-20 10:23:58,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:58,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:58,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:58,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:58,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:58,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-20 10:23:58,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:58,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:23:58,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:23:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:23:58,439 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-20 10:23:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:58,509 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-20 10:23:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:23:58,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-20 10:23:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:58,513 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:23:58,513 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 10:23:58,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:23:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 10:23:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 10:23:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:23:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-20 10:23:58,516 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-20 10:23:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:58,517 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-20 10:23:58,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:23:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-20 10:23:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 10:23:58,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:58,517 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-20 10:23:58,518 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-20 10:23:58,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:58,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:58,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:58,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:58,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:58,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:58,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:58,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 10:23:58,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:58,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:59,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-20 10:23:59,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:59,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:23:59,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:23:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:23:59,198 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-20 10:23:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:59,237 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-20 10:23:59,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:23:59,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-20 10:23:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:59,238 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:23:59,238 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 10:23:59,239 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 [2019-01-20 10:23:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 10:23:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-20 10:23:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:23:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-20 10:23:59,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-20 10:23:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:59,243 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-20 10:23:59,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:23:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-20 10:23:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 10:23:59,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:59,244 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-20 10:23:59,244 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-20 10:23:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:59,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:59,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:59,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:59,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:59,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:59,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:59,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:59,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:59,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-20 10:23:59,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:59,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 10:23:59,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 10:23:59,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:23:59,732 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-20 10:23:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:59,806 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-20 10:23:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 10:23:59,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-20 10:23:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:59,807 INFO L225 Difference]: With dead ends: 19 [2019-01-20 10:23:59,807 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:23:59,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:23:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:23:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 10:23:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:23:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-20 10:23:59,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-20 10:23:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:59,813 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-20 10:23:59,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 10:23:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-20 10:23:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 10:23:59,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:59,814 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-20 10:23:59,814 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-20 10:23:59,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:00,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:00,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:00,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:00,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:00,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:00,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:00,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:00,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:00,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:00,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:00,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:00,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-20 10:24:00,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:00,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 10:24:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 10:24:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:24:00,459 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-20 10:24:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:00,489 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-20 10:24:00,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:24:00,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-20 10:24:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:00,501 INFO L225 Difference]: With dead ends: 20 [2019-01-20 10:24:00,501 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 10:24:00,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:24:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 10:24:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-20 10:24:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:24:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-20 10:24:00,506 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-20 10:24:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:00,507 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-20 10:24:00,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 10:24:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-20 10:24:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-20 10:24:00,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:00,508 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-20 10:24:00,508 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-20 10:24:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:01,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:01,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:01,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:01,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:01,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 10:24:01,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:01,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:01,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-20 10:24:01,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:01,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:24:01,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:24:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:24:01,564 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-20 10:24:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:01,601 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-20 10:24:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 10:24:01,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-20 10:24:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:01,603 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:24:01,603 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:24:01,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:24:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:24:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 10:24:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:24:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-20 10:24:01,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-20 10:24:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:01,607 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-20 10:24:01,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:24:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-20 10:24:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 10:24:01,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:01,608 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-20 10:24:01,608 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-20 10:24:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:01,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:01,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:01,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:01,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:01,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:01,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:01,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:01,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:01,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:02,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:02,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-20 10:24:02,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:02,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 10:24:02,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 10:24:02,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:02,520 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-20 10:24:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:02,555 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-20 10:24:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 10:24:02,556 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-20 10:24:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:02,557 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:24:02,557 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:24:02,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:24:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-20 10:24:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:24:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-20 10:24:02,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-20 10:24:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:02,561 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-20 10:24:02,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 10:24:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-20 10:24:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-20 10:24:02,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:02,562 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-20 10:24:02,562 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-20 10:24:02,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:03,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:03,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:03,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:03,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:03,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:03,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:03,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:03,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:03,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:03,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:03,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:03,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-20 10:24:03,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:03,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 10:24:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 10:24:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 10:24:03,735 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-20 10:24:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:03,760 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-20 10:24:03,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 10:24:03,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-20 10:24:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:03,762 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:24:03,762 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:24:03,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 10:24:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:24:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 10:24:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:24:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-20 10:24:03,765 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-20 10:24:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:03,766 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-20 10:24:03,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 10:24:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-20 10:24:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 10:24:03,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:03,767 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-20 10:24:03,767 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-20 10:24:03,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:03,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:03,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:03,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:03,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:04,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:04,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:04,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:04,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:04,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:04,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:04,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:04,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:04,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 10:24:04,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:04,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:04,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:04,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:04,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-20 10:24:04,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:04,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 10:24:04,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 10:24:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:24:04,873 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-20 10:24:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:04,899 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-20 10:24:04,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 10:24:04,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-20 10:24:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:04,901 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:24:04,901 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 10:24:04,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:24:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 10:24:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-20 10:24:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 10:24:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-20 10:24:04,906 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-20 10:24:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:04,906 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-20 10:24:04,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 10:24:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-20 10:24:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-20 10:24:04,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:04,907 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-20 10:24:04,907 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-20 10:24:04,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:04,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:04,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:05,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:05,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:05,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:05,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:05,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:05,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:05,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:05,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:05,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:05,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:05,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:06,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:06,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-20 10:24:06,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:06,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 10:24:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 10:24:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:24:06,383 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-20 10:24:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:06,427 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-20 10:24:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 10:24:06,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-20 10:24:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:06,428 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:24:06,429 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:24:06,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:24:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:24:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 10:24:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:24:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-20 10:24:06,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-20 10:24:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:06,433 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-20 10:24:06,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 10:24:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-20 10:24:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 10:24:06,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:06,434 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-20 10:24:06,435 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-20 10:24:06,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:06,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:06,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:06,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:06,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:06,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:06,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:06,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:06,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:06,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:06,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:06,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:06,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:07,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:07,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-20 10:24:07,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:07,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 10:24:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 10:24:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 10:24:07,225 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-20 10:24:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:07,291 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-20 10:24:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 10:24:07,292 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-20 10:24:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:07,293 INFO L225 Difference]: With dead ends: 26 [2019-01-20 10:24:07,294 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:24:07,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 10:24:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:24:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-20 10:24:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:24:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-20 10:24:07,297 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-20 10:24:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:07,298 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-20 10:24:07,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 10:24:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-20 10:24:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 10:24:07,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:07,298 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-20 10:24:07,299 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-20 10:24:07,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:07,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:07,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:07,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:07,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:07,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:07,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:07,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:07,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:07,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:07,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 10:24:07,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:07,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:07,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:08,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-20 10:24:08,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:08,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:24:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:24:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:24:08,171 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-20 10:24:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:08,219 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-20 10:24:08,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 10:24:08,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-20 10:24:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:08,220 INFO L225 Difference]: With dead ends: 27 [2019-01-20 10:24:08,221 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 10:24:08,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:24:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 10:24:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 10:24:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:24:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-20 10:24:08,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-20 10:24:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:08,225 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-20 10:24:08,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:24:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-20 10:24:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 10:24:08,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:08,227 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-20 10:24:08,227 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-20 10:24:08,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:08,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:08,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:08,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:08,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:08,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:08,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:08,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:08,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:08,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:08,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:08,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:08,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:08,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:08,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:09,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:09,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-20 10:24:09,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:09,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 10:24:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 10:24:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:24:09,174 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-20 10:24:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:09,294 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-20 10:24:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 10:24:09,296 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-20 10:24:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:09,296 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:24:09,296 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 10:24:09,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:24:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 10:24:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-20 10:24:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:24:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-20 10:24:09,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-20 10:24:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:09,301 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-20 10:24:09,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 10:24:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-20 10:24:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-20 10:24:09,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:09,307 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-20 10:24:09,307 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-20 10:24:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:09,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:09,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:09,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:09,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:09,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:09,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:09,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:09,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:09,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:09,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:09,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:10,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:10,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-20 10:24:10,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:10,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 10:24:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 10:24:10,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 10:24:10,390 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-20 10:24:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:10,426 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-20 10:24:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 10:24:10,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-20 10:24:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:10,427 INFO L225 Difference]: With dead ends: 29 [2019-01-20 10:24:10,427 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:24:10,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 10:24:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:24:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 10:24:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 10:24:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-20 10:24:10,432 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-20 10:24:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:10,432 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-20 10:24:10,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 10:24:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-20 10:24:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 10:24:10,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:10,433 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-20 10:24:10,434 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-20 10:24:10,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:10,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:10,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:10,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:10,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:10,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:10,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:10,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:10,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:10,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:10,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:10,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:10,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 10:24:10,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:10,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:10,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:11,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:11,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-20 10:24:11,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:11,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 10:24:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 10:24:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:24:11,955 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-20 10:24:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:12,001 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-20 10:24:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 10:24:12,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-20 10:24:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:12,008 INFO L225 Difference]: With dead ends: 30 [2019-01-20 10:24:12,008 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:24:12,009 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 [2019-01-20 10:24:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:24:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-20 10:24:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:24:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-20 10:24:12,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-20 10:24:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:12,012 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-20 10:24:12,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 10:24:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-20 10:24:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 10:24:12,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:12,013 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-20 10:24:12,013 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-20 10:24:12,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:12,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:12,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:12,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:12,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:12,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:12,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:12,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:12,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:12,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:12,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:12,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:12,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:12,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:12,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:12,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:12,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:13,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:13,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-20 10:24:13,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:13,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 10:24:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 10:24:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:24:13,165 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-20 10:24:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:13,216 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-20 10:24:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 10:24:13,217 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-20 10:24:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:13,218 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:24:13,218 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 10:24:13,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:24:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 10:24:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 10:24:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:24:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-20 10:24:13,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-20 10:24:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:13,222 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-20 10:24:13,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 10:24:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-20 10:24:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 10:24:13,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:13,223 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-20 10:24:13,223 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-20 10:24:13,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:13,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:13,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:13,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:13,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:13,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:13,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:13,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:13,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:13,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:13,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:13,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:13,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:14,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:14,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-20 10:24:14,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:14,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 10:24:14,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 10:24:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 10:24:14,529 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-20 10:24:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:14,631 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-20 10:24:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 10:24:14,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-20 10:24:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:14,633 INFO L225 Difference]: With dead ends: 32 [2019-01-20 10:24:14,633 INFO L226 Difference]: Without dead ends: 30 [2019-01-20 10:24:14,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 10:24:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-20 10:24:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-20 10:24:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:24:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-20 10:24:14,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-20 10:24:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:14,638 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-20 10:24:14,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 10:24:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-20 10:24:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-20 10:24:14,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:14,640 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-20 10:24:14,640 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-20 10:24:14,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:14,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:14,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:15,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:15,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:15,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:15,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:15,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:15,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:15,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:15,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:15,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 10:24:15,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:15,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:15,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-20 10:24:17,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:17,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:24:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:24:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 10:24:17,387 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-20 10:24:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:17,548 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-20 10:24:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 10:24:17,548 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-20 10:24:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:17,549 INFO L225 Difference]: With dead ends: 33 [2019-01-20 10:24:17,549 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:24:17,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 10:24:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:24:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 10:24:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:24:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-20 10:24:17,554 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-20 10:24:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:17,554 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-20 10:24:17,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:24:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-20 10:24:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 10:24:17,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:17,555 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-20 10:24:17,556 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-20 10:24:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:17,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:17,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:18,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:18,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:18,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:18,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:18,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:18,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:18,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:18,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:18,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:18,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:18,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:18,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:19,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:19,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-20 10:24:19,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:19,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 10:24:19,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 10:24:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:24:19,803 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-20 10:24:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:19,839 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-20 10:24:19,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 10:24:19,839 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-20 10:24:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:19,840 INFO L225 Difference]: With dead ends: 34 [2019-01-20 10:24:19,840 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 10:24:19,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:24:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 10:24:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-20 10:24:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:24:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-20 10:24:19,845 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-20 10:24:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:19,846 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-20 10:24:19,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 10:24:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-20 10:24:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-20 10:24:19,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:19,846 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-20 10:24:19,847 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-20 10:24:19,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:19,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:19,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:20,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:20,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:20,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:20,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:20,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:20,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:20,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:20,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:20,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:21,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:21,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-20 10:24:21,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:21,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 10:24:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 10:24:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 10:24:21,416 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-20 10:24:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:21,553 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-20 10:24:21,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 10:24:21,553 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-20 10:24:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:21,554 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:24:21,554 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 10:24:21,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 10:24:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 10:24:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 10:24:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:24:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-20 10:24:21,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-20 10:24:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:21,558 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-20 10:24:21,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 10:24:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-20 10:24:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 10:24:21,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:21,559 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-20 10:24:21,559 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-20 10:24:21,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:21,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:21,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:22,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:22,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:22,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:22,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:22,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:22,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:22,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:22,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:22,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 10:24:22,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:22,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:22,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:23,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:23,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-20 10:24:23,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:23,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 10:24:23,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 10:24:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:24:23,187 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-20 10:24:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:23,244 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-20 10:24:23,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 10:24:23,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-20 10:24:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:23,247 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:24:23,247 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 10:24:23,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:24:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 10:24:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-20 10:24:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 10:24:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-20 10:24:23,251 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-20 10:24:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:23,251 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-20 10:24:23,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 10:24:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-20 10:24:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-20 10:24:23,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:23,252 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-20 10:24:23,252 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-20 10:24:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:23,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:23,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:23,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:23,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:23,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:23,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:23,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:23,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:23,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:23,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:23,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:23,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:23,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:24,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:25,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:25,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-20 10:24:25,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:25,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 10:24:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 10:24:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:24:25,031 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-20 10:24:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:25,111 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-20 10:24:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 10:24:25,111 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-20 10:24:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:25,112 INFO L225 Difference]: With dead ends: 37 [2019-01-20 10:24:25,112 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:24:25,113 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 [2019-01-20 10:24:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:24:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 10:24:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:24:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-20 10:24:25,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-20 10:24:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:25,115 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-20 10:24:25,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 10:24:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-20 10:24:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 10:24:25,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:25,116 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-20 10:24:25,116 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-20 10:24:25,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:25,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:25,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:25,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:25,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:25,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:25,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:25,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:25,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:25,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:25,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:25,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:25,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:25,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:25,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:26,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-20 10:24:26,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:26,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 10:24:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 10:24:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 10:24:26,924 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-20 10:24:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:26,990 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-20 10:24:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 10:24:26,991 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-20 10:24:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:26,991 INFO L225 Difference]: With dead ends: 38 [2019-01-20 10:24:26,991 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:24:26,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 10:24:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:24:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-20 10:24:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:24:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-20 10:24:26,996 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-20 10:24:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:26,996 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-20 10:24:26,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 10:24:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-20 10:24:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 10:24:26,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:26,997 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-20 10:24:26,997 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-20 10:24:26,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:26,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:27,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:27,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:27,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:27,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:27,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:27,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:27,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:27,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:27,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 10:24:27,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:27,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:27,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-20 10:24:28,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:28,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 10:24:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 10:24:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 10:24:28,928 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-20 10:24:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:28,967 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-20 10:24:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 10:24:28,968 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-20 10:24:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:28,968 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:24:28,968 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:24:28,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 10:24:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:24:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 10:24:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:24:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-20 10:24:28,973 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-20 10:24:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:28,973 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-20 10:24:28,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 10:24:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-20 10:24:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 10:24:28,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:28,974 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-20 10:24:28,974 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-20 10:24:28,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:28,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:28,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:29,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:29,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:29,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:29,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:29,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:29,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:29,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:29,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:29,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:29,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:29,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:29,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-20 10:24:30,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:30,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 10:24:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 10:24:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:24:30,811 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-20 10:24:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:30,875 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-20 10:24:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 10:24:30,876 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-20 10:24:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:30,877 INFO L225 Difference]: With dead ends: 40 [2019-01-20 10:24:30,877 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:24:30,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:24:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:24:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-20 10:24:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:24:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-20 10:24:30,881 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-20 10:24:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:30,882 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-20 10:24:30,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 10:24:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-20 10:24:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-20 10:24:30,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:30,882 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-20 10:24:30,883 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-20 10:24:30,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:30,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:30,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:30,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:30,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:31,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:31,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:31,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:31,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:31,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:31,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:31,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:31,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:31,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:31,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:33,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:33,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-20 10:24:33,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:33,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 10:24:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 10:24:33,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 10:24:33,062 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-20 10:24:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:33,130 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-20 10:24:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 10:24:33,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-20 10:24:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:33,132 INFO L225 Difference]: With dead ends: 41 [2019-01-20 10:24:33,132 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 10:24:33,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 10:24:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 10:24:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 10:24:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:24:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-20 10:24:33,136 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-20 10:24:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:33,136 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-20 10:24:33,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 10:24:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-20 10:24:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 10:24:33,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:33,137 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-20 10:24:33,137 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-20 10:24:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:33,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:33,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:33,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:33,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:33,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:33,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:33,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:33,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:34,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 10:24:34,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:34,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:34,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:35,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:35,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-20 10:24:35,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:35,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 10:24:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 10:24:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:24:35,513 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-20 10:24:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:35,563 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-20 10:24:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 10:24:35,564 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-20 10:24:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:35,565 INFO L225 Difference]: With dead ends: 42 [2019-01-20 10:24:35,565 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:24:35,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:24:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:24:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-20 10:24:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:24:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-20 10:24:35,568 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-20 10:24:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:35,568 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-20 10:24:35,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 10:24:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-20 10:24:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-20 10:24:35,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:35,569 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-20 10:24:35,569 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-20 10:24:35,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:35,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:35,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:36,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:36,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:36,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:36,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:36,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:36,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:36,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:36,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:36,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:36,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:38,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:38,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-20 10:24:38,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:38,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 10:24:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 10:24:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:24:38,171 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-20 10:24:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:38,230 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-20 10:24:38,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 10:24:38,231 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-20 10:24:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:38,231 INFO L225 Difference]: With dead ends: 43 [2019-01-20 10:24:38,232 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 10:24:38,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:24:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 10:24:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 10:24:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:24:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-20 10:24:38,235 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-20 10:24:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:38,235 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-20 10:24:38,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 10:24:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-20 10:24:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 10:24:38,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:38,236 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-20 10:24:38,237 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-20 10:24:38,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:38,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:38,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:38,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:38,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:39,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:39,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:39,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:39,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:39,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:39,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:39,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:39,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:39,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:39,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:41,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:41,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-20 10:24:41,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:41,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 10:24:41,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 10:24:41,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:24:41,021 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-20 10:24:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:41,127 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-20 10:24:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 10:24:41,128 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-20 10:24:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:41,128 INFO L225 Difference]: With dead ends: 44 [2019-01-20 10:24:41,129 INFO L226 Difference]: Without dead ends: 42 [2019-01-20 10:24:41,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:24:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-20 10:24:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-20 10:24:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:24:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-20 10:24:41,132 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-20 10:24:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:41,133 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-20 10:24:41,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 10:24:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-20 10:24:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-20 10:24:41,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:41,133 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-20 10:24:41,134 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:41,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-20 10:24:41,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:41,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:41,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:41,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:41,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:42,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:42,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:42,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:42,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:42,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:42,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:42,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:42,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:42,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 10:24:42,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:42,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:42,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:43,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-20 10:24:43,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:43,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 10:24:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 10:24:43,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:24:43,939 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-20 10:24:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:44,001 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-20 10:24:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 10:24:44,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-20 10:24:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:44,002 INFO L225 Difference]: With dead ends: 45 [2019-01-20 10:24:44,002 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 10:24:44,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:24:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 10:24:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 10:24:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 10:24:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-20 10:24:44,005 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-20 10:24:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:44,006 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-20 10:24:44,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 10:24:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-20 10:24:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 10:24:44,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:44,006 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-20 10:24:44,006 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-20 10:24:44,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:44,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:44,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:44,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:44,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:44,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:44,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:44,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:44,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:44,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:44,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:44,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:44,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:44,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:44,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-20 10:24:46,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:46,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 10:24:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 10:24:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:24:46,454 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-20 10:24:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:46,528 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-20 10:24:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 10:24:46,528 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-20 10:24:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:46,529 INFO L225 Difference]: With dead ends: 46 [2019-01-20 10:24:46,529 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:24:46,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:24:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:24:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-20 10:24:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-20 10:24:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-20 10:24:46,531 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-20 10:24:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:46,531 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-20 10:24:46,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 10:24:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-20 10:24:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-20 10:24:46,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:46,532 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-20 10:24:46,532 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-20 10:24:46,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:46,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:46,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:47,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:47,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:47,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:47,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:47,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:47,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:47,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:47,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:49,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:49,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-20 10:24:49,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:49,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 10:24:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 10:24:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 10:24:49,569 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-20 10:24:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:49,680 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-20 10:24:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 10:24:49,681 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-20 10:24:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:49,682 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:24:49,682 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:24:49,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 10:24:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:24:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 10:24:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:24:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-20 10:24:49,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-20 10:24:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:49,684 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-20 10:24:49,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 10:24:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-20 10:24:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 10:24:49,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:49,685 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-20 10:24:49,685 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-20 10:24:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:50,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:50,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:50,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:50,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:50,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:50,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:50,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:50,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:50,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 10:24:50,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:50,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:50,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:52,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:52,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-20 10:24:52,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:52,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 10:24:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 10:24:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:24:52,845 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-20 10:24:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:52,921 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-20 10:24:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 10:24:52,921 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-20 10:24:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:52,922 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:24:52,922 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 10:24:52,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:24:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 10:24:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-20 10:24:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 10:24:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-20 10:24:52,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-20 10:24:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:52,925 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-20 10:24:52,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 10:24:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-20 10:24:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-20 10:24:52,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:52,926 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-20 10:24:52,926 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-20 10:24:52,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:52,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:52,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:53,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:53,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:53,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:53,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:53,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:53,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:53,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:53,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:53,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:55,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-20 10:24:55,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:55,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 10:24:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 10:24:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:24:55,773 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-20 10:24:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:55,827 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-20 10:24:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 10:24:55,827 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-20 10:24:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:55,828 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:24:55,828 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:24:55,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:24:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:24:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 10:24:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:24:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-20 10:24:55,832 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-20 10:24:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:55,832 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-20 10:24:55,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 10:24:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-20 10:24:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 10:24:55,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:55,832 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-20 10:24:55,833 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-20 10:24:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:55,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:55,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:56,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:56,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:56,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:56,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:56,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:56,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:56,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:56,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:56,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:59,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:59,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-20 10:24:59,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:59,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 10:24:59,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 10:24:59,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 10:24:59,267 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-20 10:24:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:59,345 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-20 10:24:59,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 10:24:59,346 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-20 10:24:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:59,347 INFO L225 Difference]: With dead ends: 50 [2019-01-20 10:24:59,347 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:24:59,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 10:24:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:24:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-20 10:24:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:24:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-20 10:24:59,350 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-20 10:24:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:59,350 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-20 10:24:59,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 10:24:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-20 10:24:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-20 10:24:59,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:59,351 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-20 10:24:59,351 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-20 10:24:59,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:59,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:59,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:59,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:00,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:00,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:00,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:00,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:00,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:00,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:00,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 10:25:00,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:00,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:00,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-20 10:25:02,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:02,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:25:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:25:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:25:02,924 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-20 10:25:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:03,003 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-20 10:25:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:25:03,004 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-20 10:25:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:03,005 INFO L225 Difference]: With dead ends: 51 [2019-01-20 10:25:03,005 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 10:25:03,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:25:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 10:25:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 10:25:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 10:25:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-20 10:25:03,008 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-20 10:25:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:03,009 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-20 10:25:03,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:25:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-20 10:25:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 10:25:03,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:03,010 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-20 10:25:03,010 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:03,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-20 10:25:03,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:03,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:03,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:03,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:03,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:03,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:03,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:03,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:03,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:03,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:03,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:03,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:03,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:06,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:06,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-20 10:25:06,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:06,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 10:25:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 10:25:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:25:06,247 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-20 10:25:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:06,467 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-20 10:25:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:25:06,468 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-20 10:25:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:06,469 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:25:06,469 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 10:25:06,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:25:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 10:25:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-20 10:25:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 10:25:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-20 10:25:06,471 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-20 10:25:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:06,471 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-20 10:25:06,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 10:25:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-20 10:25:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-20 10:25:06,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:06,473 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-20 10:25:06,473 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-20 10:25:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:06,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:06,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:07,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:07,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:07,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:07,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:07,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:07,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:07,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:07,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:07,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:07,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:10,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:10,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-20 10:25:10,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:10,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 10:25:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 10:25:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 10:25:10,430 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-20 10:25:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:10,520 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-20 10:25:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 10:25:10,520 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-20 10:25:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:10,521 INFO L225 Difference]: With dead ends: 53 [2019-01-20 10:25:10,521 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:25:10,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 10:25:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:25:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 10:25:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:25:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-20 10:25:10,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-20 10:25:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:10,524 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-20 10:25:10,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 10:25:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-20 10:25:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 10:25:10,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:10,525 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-20 10:25:10,525 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-20 10:25:10,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:10,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:10,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:10,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:10,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:11,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:11,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:11,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:11,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:11,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:11,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:11,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:11,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:11,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 10:25:11,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:11,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:11,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:14,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:14,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-20 10:25:14,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:14,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 10:25:14,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 10:25:14,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:25:14,451 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-20 10:25:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:14,513 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-20 10:25:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:25:14,514 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-20 10:25:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:14,515 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:25:14,515 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:25:14,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:25:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:25:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-20 10:25:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 10:25:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-20 10:25:14,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-20 10:25:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:14,519 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-20 10:25:14,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 10:25:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-20 10:25:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 10:25:14,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:14,520 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-20 10:25:14,520 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-20 10:25:14,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:14,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:14,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:15,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:15,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:15,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:15,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:15,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:15,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:15,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:15,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:15,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:15,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:15,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:15,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:18,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:18,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-20 10:25:18,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:18,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 10:25:18,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 10:25:18,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:25:18,444 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-20 10:25:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:18,569 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-20 10:25:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:25:18,569 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-20 10:25:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:18,570 INFO L225 Difference]: With dead ends: 55 [2019-01-20 10:25:18,570 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:25:18,570 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 [2019-01-20 10:25:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:25:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 10:25:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 10:25:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-20 10:25:18,575 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-20 10:25:18,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:18,575 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-20 10:25:18,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 10:25:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-20 10:25:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 10:25:18,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:18,575 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-20 10:25:18,575 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:18,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-20 10:25:18,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:18,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:18,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:18,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:19,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:19,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:19,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:19,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:19,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:19,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:19,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:19,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:19,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:22,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-20 10:25:22,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:22,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 10:25:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 10:25:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:25:22,324 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-20 10:25:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:22,387 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-20 10:25:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:25:22,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-20 10:25:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:22,388 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:25:22,388 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 10:25:22,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:25:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 10:25:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-20 10:25:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 10:25:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-20 10:25:22,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-20 10:25:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:22,391 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-20 10:25:22,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 10:25:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-20 10:25:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-20 10:25:22,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:22,392 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-20 10:25:22,392 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:22,393 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-20 10:25:22,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:22,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:22,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:22,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:23,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:23,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:23,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:23,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:23,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:23,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:23,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:23,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:23,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 10:25:23,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:23,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:23,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:26,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:26,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-20 10:25:26,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:26,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:25:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:25:26,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 10:25:26,709 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-20 10:25:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:26,851 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-20 10:25:26,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:25:26,852 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-20 10:25:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:26,852 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:25:26,853 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:25:26,853 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 [2019-01-20 10:25:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:25:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 10:25:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:25:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-20 10:25:26,856 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-20 10:25:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:26,856 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-20 10:25:26,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:25:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-20 10:25:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 10:25:26,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:26,857 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-20 10:25:26,857 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-20 10:25:26,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:26,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:26,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:26,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:26,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:27,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:27,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:27,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:27,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:27,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:27,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:28,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:28,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:28,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:28,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:28,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:31,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:31,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-20 10:25:31,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:31,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 10:25:31,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 10:25:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:25:31,103 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-20 10:25:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:31,200 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-20 10:25:31,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:25:31,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-20 10:25:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:31,201 INFO L225 Difference]: With dead ends: 58 [2019-01-20 10:25:31,201 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:25:31,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:25:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:25:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-20 10:25:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 10:25:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-20 10:25:31,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-20 10:25:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:31,204 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-20 10:25:31,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 10:25:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-20 10:25:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 10:25:31,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:31,205 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-20 10:25:31,205 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-20 10:25:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:31,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:31,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:31,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:31,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:32,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:32,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:32,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:32,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:32,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:32,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:32,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:32,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:35,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:35,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-20 10:25:35,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:35,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 10:25:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 10:25:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 10:25:35,623 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-20 10:25:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:35,732 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-20 10:25:35,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:25:35,733 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-20 10:25:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:35,733 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:25:35,734 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:25:35,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 10:25:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:25:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 10:25:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 10:25:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-20 10:25:35,737 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-20 10:25:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:35,737 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-20 10:25:35,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 10:25:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-20 10:25:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 10:25:35,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:35,738 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-20 10:25:35,738 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-20 10:25:35,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:35,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:35,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:35,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:35,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:36,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:36,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:36,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:36,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:36,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:36,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:36,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:37,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-20 10:25:37,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:37,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:37,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:40,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:40,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-20 10:25:40,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:40,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 10:25:40,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 10:25:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:25:40,589 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-20 10:25:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:40,659 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-20 10:25:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:25:40,660 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-20 10:25:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:40,661 INFO L225 Difference]: With dead ends: 60 [2019-01-20 10:25:40,661 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:25:40,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:25:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:25:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-20 10:25:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:25:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-20 10:25:40,665 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-20 10:25:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:40,665 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-20 10:25:40,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 10:25:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-20 10:25:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-20 10:25:40,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:40,665 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-20 10:25:40,666 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:40,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:40,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-20 10:25:40,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:40,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:40,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:40,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:40,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:41,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:41,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:41,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:41,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:41,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:41,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:41,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:41,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:41,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:41,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:41,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:41,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:45,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:45,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-20 10:25:45,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:45,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-20 10:25:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-20 10:25:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:25:45,390 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-20 10:25:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:45,484 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-20 10:25:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:25:45,484 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-20 10:25:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:45,485 INFO L225 Difference]: With dead ends: 61 [2019-01-20 10:25:45,485 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 10:25:45,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:25:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 10:25:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 10:25:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:25:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-20 10:25:45,488 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-20 10:25:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:45,488 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-20 10:25:45,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-20 10:25:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-20 10:25:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 10:25:45,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:45,489 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-20 10:25:45,490 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-20 10:25:45,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:45,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:45,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:46,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:46,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:46,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:46,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:46,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:46,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:46,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:46,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:46,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:46,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:50,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:50,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-20 10:25:50,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:50,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 10:25:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 10:25:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:25:50,325 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-20 10:25:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:50,446 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-20 10:25:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:25:50,446 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-20 10:25:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:50,447 INFO L225 Difference]: With dead ends: 62 [2019-01-20 10:25:50,447 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 10:25:50,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:25:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 10:25:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-20 10:25:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 10:25:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-20 10:25:50,450 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-20 10:25:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:50,450 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-20 10:25:50,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 10:25:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-20 10:25:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-20 10:25:50,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:50,451 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-20 10:25:50,451 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-20 10:25:50,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:50,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:51,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:51,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:51,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:51,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:51,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:51,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:51,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:52,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 10:25:52,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:52,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:52,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-20 10:25:55,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:55,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 10:25:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 10:25:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 10:25:55,876 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-20 10:25:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:55,953 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-20 10:25:55,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:25:55,954 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-20 10:25:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:55,955 INFO L225 Difference]: With dead ends: 63 [2019-01-20 10:25:55,955 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:25:55,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 10:25:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:25:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 10:25:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:25:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-20 10:25:55,959 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-20 10:25:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:55,960 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-20 10:25:55,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 10:25:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-20 10:25:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 10:25:55,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:55,960 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-20 10:25:55,961 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-20 10:25:55,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:55,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:55,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:55,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:57,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:57,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:57,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:57,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:57,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:57,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:57,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:57,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:57,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:57,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:57,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:57,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:01,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-20 10:26:01,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:01,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 10:26:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 10:26:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:26:01,298 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-20 10:26:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:01,407 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-20 10:26:01,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:26:01,407 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-20 10:26:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:01,408 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:26:01,408 INFO L226 Difference]: Without dead ends: 62 [2019-01-20 10:26:01,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:26:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-20 10:26:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-20 10:26:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-20 10:26:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-20 10:26:01,412 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-20 10:26:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:01,412 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-20 10:26:01,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 10:26:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-20 10:26:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-20 10:26:01,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:01,413 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-20 10:26:01,413 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-20 10:26:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:01,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:01,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:03,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:03,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:03,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:03,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:03,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:03,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:03,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:03,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:03,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:03,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:07,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:07,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-20 10:26:07,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:07,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-20 10:26:07,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-20 10:26:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 10:26:07,327 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-20 10:26:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:07,419 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-20 10:26:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:26:07,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-20 10:26:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:07,421 INFO L225 Difference]: With dead ends: 65 [2019-01-20 10:26:07,421 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:26:07,422 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 [2019-01-20 10:26:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:26:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 10:26:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 10:26:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-20 10:26:07,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-20 10:26:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:07,425 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-20 10:26:07,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-20 10:26:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-20 10:26:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 10:26:07,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:07,426 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-20 10:26:07,426 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-20 10:26:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:07,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:07,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:12,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:12,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:12,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:12,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:12,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:12,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:12,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:12,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:12,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-20 10:26:12,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:12,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:12,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:16,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:16,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-20 10:26:16,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:16,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 10:26:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 10:26:16,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:26:16,772 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-20 10:26:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:16,852 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-20 10:26:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:26:16,853 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-20 10:26:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:16,853 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:26:16,853 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 10:26:16,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:26:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 10:26:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-20 10:26:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:26:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-20 10:26:16,856 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-20 10:26:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:16,856 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-20 10:26:16,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 10:26:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-20 10:26:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-20 10:26:16,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:16,857 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-20 10:26:16,857 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-20 10:26:16,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:16,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:16,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:16,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:18,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:18,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:18,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:18,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:18,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:18,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:18,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:18,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:18,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:18,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:18,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:22,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:22,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-20 10:26:22,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:22,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-20 10:26:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-20 10:26:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:26:22,627 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-20 10:26:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:22,740 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-20 10:26:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:26:22,740 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-20 10:26:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:22,741 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:26:22,741 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:26:22,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:26:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:26:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 10:26:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 10:26:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-20 10:26:22,744 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-20 10:26:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:22,744 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-20 10:26:22,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-20 10:26:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-20 10:26:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 10:26:22,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:22,745 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-20 10:26:22,745 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-20 10:26:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:22,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:22,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:24,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:24,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:24,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:24,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:24,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:24,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:24,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:24,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:24,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:24,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:28,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:28,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-20 10:26:28,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:28,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 10:26:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 10:26:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:26:28,522 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-20 10:26:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:28,644 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-20 10:26:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:26:28,644 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-20 10:26:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:28,645 INFO L225 Difference]: With dead ends: 68 [2019-01-20 10:26:28,645 INFO L226 Difference]: Without dead ends: 66 [2019-01-20 10:26:28,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:26:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-20 10:26:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-20 10:26:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:26:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-20 10:26:28,648 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-20 10:26:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:28,648 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-20 10:26:28,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 10:26:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-20 10:26:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 10:26:28,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:28,648 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-20 10:26:28,649 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:28,649 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-20 10:26:28,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:28,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:28,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:28,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:28,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:31,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:31,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:31,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:31,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:31,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:31,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:31,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:31,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:32,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 10:26:32,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:32,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:32,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:36,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-20 10:26:36,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:36,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:26:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:26:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:26:36,748 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-20 10:26:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:36,868 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-20 10:26:36,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:26:36,868 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-20 10:26:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:36,869 INFO L225 Difference]: With dead ends: 69 [2019-01-20 10:26:36,869 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:26:36,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:26:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:26:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 10:26:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:26:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-20 10:26:36,872 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-20 10:26:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:36,873 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-20 10:26:36,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:26:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-20 10:26:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 10:26:36,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:36,873 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-20 10:26:36,873 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-20 10:26:36,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:36,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:36,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:38,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:38,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:38,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:38,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:38,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:38,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:38,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:38,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:39,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:39,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:39,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:39,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:43,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:43,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-20 10:26:43,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:43,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 10:26:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 10:26:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:26:43,578 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-20 10:26:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:43,695 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-20 10:26:43,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:26:43,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-20 10:26:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:43,703 INFO L225 Difference]: With dead ends: 70 [2019-01-20 10:26:43,703 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:26:43,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:26:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:26:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-20 10:26:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:26:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-20 10:26:43,706 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-20 10:26:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:43,706 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-20 10:26:43,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 10:26:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-20 10:26:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-20 10:26:43,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:43,707 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-20 10:26:43,707 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-20 10:26:43,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:43,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:43,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:45,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:45,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:45,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:45,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:45,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:45,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:45,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:45,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-20 10:26:50,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:50,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-20 10:26:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-20 10:26:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:26:50,309 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-20 10:26:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:50,399 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-20 10:26:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:26:50,400 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-20 10:26:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:50,400 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:26:50,401 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:26:50,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:26:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:26:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 10:26:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:26:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-20 10:26:50,405 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-20 10:26:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:50,405 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-20 10:26:50,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-20 10:26:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-20 10:26:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:26:50,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:50,406 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-20 10:26:50,406 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-20 10:26:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:50,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:50,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:52,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:52,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:52,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:52,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:52,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:52,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:52,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:53,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:26:53,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:53,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:53,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:58,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:58,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-20 10:26:58,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:58,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 10:26:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 10:26:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:26:58,717 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-20 10:26:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:58,821 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-20 10:26:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:26:58,822 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-20 10:26:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:58,823 INFO L225 Difference]: With dead ends: 72 [2019-01-20 10:26:58,823 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:26:58,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:26:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:26:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-20 10:26:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-20 10:26:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-20 10:26:58,827 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-20 10:26:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:58,827 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-20 10:26:58,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 10:26:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-20 10:26:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-20 10:26:58,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:58,828 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-20 10:26:58,828 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-20 10:26:58,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:58,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:58,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:00,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:00,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:00,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:00,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:00,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:00,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:00,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:00,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:00,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:00,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:00,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:00,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:05,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-20 10:27:05,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:05,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-20 10:27:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-20 10:27:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:27:05,890 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-20 10:27:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:06,252 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-20 10:27:06,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:27:06,253 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-20 10:27:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:06,254 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:27:06,254 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:27:06,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:27:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:27:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 10:27:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:27:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-20 10:27:06,257 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-20 10:27:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:06,257 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-20 10:27:06,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-20 10:27:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-20 10:27:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 10:27:06,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:06,258 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-20 10:27:06,258 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:06,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-20 10:27:06,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:06,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:06,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:07,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:07,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:07,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:07,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:07,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:07,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:07,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:07,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:07,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:07,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:13,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:13,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-20 10:27:13,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:13,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:27:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:27:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:27:13,163 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-20 10:27:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:13,259 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-20 10:27:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:27:13,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-20 10:27:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:13,260 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:27:13,260 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:27:13,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:27:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:27:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-20 10:27:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:27:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-20 10:27:13,264 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-20 10:27:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:13,264 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-20 10:27:13,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:27:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-20 10:27:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-20 10:27:13,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:13,264 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-20 10:27:13,264 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-20 10:27:13,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:13,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:13,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:15,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:15,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:15,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:15,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:15,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:15,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:15,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:15,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:15,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-20 10:27:15,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:15,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:15,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:20,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:20,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-20 10:27:20,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:20,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:27:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:27:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:27:20,503 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-20 10:27:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:20,770 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-20 10:27:20,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:27:20,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-20 10:27:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:20,771 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:27:20,771 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:27:20,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:27:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:27:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 10:27:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:27:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-20 10:27:20,774 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-20 10:27:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:20,774 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-20 10:27:20,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:27:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-20 10:27:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:27:20,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:20,775 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-20 10:27:20,775 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-20 10:27:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:20,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:20,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:22,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:22,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:22,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:22,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:22,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:22,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:22,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:22,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:22,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:22,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:22,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:22,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-20 10:27:27,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:27,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 10:27:27,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 10:27:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:27:27,935 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-20 10:27:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:28,090 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-20 10:27:28,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:27:28,091 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-20 10:27:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:28,091 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:27:28,091 INFO L226 Difference]: Without dead ends: 74 [2019-01-20 10:27:28,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:27:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-20 10:27:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-20 10:27:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:27:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-20 10:27:28,095 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-20 10:27:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:28,095 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-20 10:27:28,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 10:27:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-20 10:27:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-20 10:27:28,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:28,096 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-20 10:27:28,097 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-20 10:27:28,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:28,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:28,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:28,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:29,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:29,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:29,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:29,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:29,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:29,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:29,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:29,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:29,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:35,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-20 10:27:35,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:35,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-20 10:27:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-20 10:27:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:27:35,476 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-20 10:27:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:35,607 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-20 10:27:35,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:27:35,607 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-20 10:27:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:35,608 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:27:35,608 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:27:35,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:27:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:27:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 10:27:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:27:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-20 10:27:35,612 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-20 10:27:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:35,613 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-20 10:27:35,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-20 10:27:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-20 10:27:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 10:27:35,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:35,614 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-20 10:27:35,614 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-20 10:27:35,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:35,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:35,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:37,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:37,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:37,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:37,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:37,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:37,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:37,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:37,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:38,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-20 10:27:38,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:38,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:38,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:44,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:44,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-20 10:27:44,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:44,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:27:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:27:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:27:44,055 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-20 10:27:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:44,205 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-20 10:27:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:27:44,205 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-20 10:27:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:44,206 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:27:44,206 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:27:44,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:27:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:27:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-20 10:27:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:27:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-20 10:27:44,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-20 10:27:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:44,210 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-20 10:27:44,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:27:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-20 10:27:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 10:27:44,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:44,211 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-20 10:27:44,211 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-20 10:27:44,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:44,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:44,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:44,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:44,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:46,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:46,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:46,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:46,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:46,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:46,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:46,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:46,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:46,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:46,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:46,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:46,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:52,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:52,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-20 10:27:52,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:52,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:27:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:27:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:27:52,164 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-20 10:27:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:52,318 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-20 10:27:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:27:52,318 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-20 10:27:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:52,319 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:27:52,319 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:27:52,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:27:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:27:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 10:27:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:27:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-20 10:27:52,322 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-20 10:27:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:52,322 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-20 10:27:52,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:27:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-20 10:27:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:27:52,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:52,323 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-20 10:27:52,324 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-20 10:27:52,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:52,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:52,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:52,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:52,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:54,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:54,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:54,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:54,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:54,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:54,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:27:54,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:54,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:54,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:54,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:00,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:00,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-20 10:28:00,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:00,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:28:00,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:28:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:28:00,735 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-20 10:28:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:00,891 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-20 10:28:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:28:00,891 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-20 10:28:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:00,892 INFO L225 Difference]: With dead ends: 80 [2019-01-20 10:28:00,892 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 10:28:00,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:28:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 10:28:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-20 10:28:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:28:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-20 10:28:00,895 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-20 10:28:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:00,895 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-20 10:28:00,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:28:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-20 10:28:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-20 10:28:00,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:00,896 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-20 10:28:00,896 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-20 10:28:00,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:00,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:00,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:00,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:00,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:03,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:03,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:03,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:03,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:03,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:28:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:03,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:03,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:28:03,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:03,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:03,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:09,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:09,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-20 10:28:09,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:09,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:28:09,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:28:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:28:09,673 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-20 10:28:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:09,789 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-20 10:28:09,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:28:09,790 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-20 10:28:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:09,791 INFO L225 Difference]: With dead ends: 81 [2019-01-20 10:28:09,791 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:28:09,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:28:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:28:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 10:28:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:28:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-20 10:28:09,795 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-20 10:28:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:09,795 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-20 10:28:09,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:28:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-20 10:28:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 10:28:09,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:09,796 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-20 10:28:09,796 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-20 10:28:09,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:09,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:09,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:09,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:12,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:12,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:12,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:12,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:12,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:12,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:28:12,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:12,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:12,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:12,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:12,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:12,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:18,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:18,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-20 10:28:18,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:18,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 10:28:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 10:28:18,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:28:18,334 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-20 10:28:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:18,453 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-20 10:28:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:28:18,454 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-20 10:28:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:18,454 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:28:18,454 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:28:18,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:28:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:28:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-20 10:28:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:28:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-20 10:28:18,457 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-20 10:28:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:18,457 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-20 10:28:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 10:28:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-20 10:28:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:28:18,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:18,458 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-20 10:28:18,458 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-20 10:28:18,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:18,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:18,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:18,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:20,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:20,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:20,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:20,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:20,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:20,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:28:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:20,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:20,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:20,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-20 10:28:27,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:27,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-20 10:28:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-20 10:28:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:28:27,127 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-20 10:28:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:27,981 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-20 10:28:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:28:27,981 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-20 10:28:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:27,982 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:28:27,982 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:28:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:28:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:28:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 10:28:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:28:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-20 10:28:27,984 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-20 10:28:27,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:27,985 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-20 10:28:27,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-20 10:28:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-20 10:28:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:28:27,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:27,985 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-20 10:28:27,985 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-20 10:28:27,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:27,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:27,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:27,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:27,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:30,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:30,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:30,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:30,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:30,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:30,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:28:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:30,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:30,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-20 10:28:30,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:30,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:30,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:37,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:37,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-20 10:28:37,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:37,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:28:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:28:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:28:37,573 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-20 10:28:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:38,288 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-20 10:28:38,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:28:38,288 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-20 10:28:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:38,289 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:28:38,289 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:28:38,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:28:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:28:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-20 10:28:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-20 10:28:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-20 10:28:38,293 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-20 10:28:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:38,293 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-20 10:28:38,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:28:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-20 10:28:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-20 10:28:38,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:38,294 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-20 10:28:38,294 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:38,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-20 10:28:38,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:38,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:38,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:40,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:40,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:40,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:40,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:40,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:40,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:28:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:40,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:40,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:40,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:40,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:40,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:47,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:47,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-20 10:28:47,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:47,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-20 10:28:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-20 10:28:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:28:47,623 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-20 10:28:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:47,847 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-20 10:28:47,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:28:47,847 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-20 10:28:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:47,848 INFO L225 Difference]: With dead ends: 85 [2019-01-20 10:28:47,848 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:28:47,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:28:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:28:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 10:28:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:28:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-20 10:28:47,851 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-20 10:28:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:47,852 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-20 10:28:47,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-20 10:28:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-20 10:28:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 10:28:47,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:47,852 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-20 10:28:47,853 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-20 10:28:47,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:47,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:47,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:47,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:47,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:50,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:50,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:50,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:50,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:50,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:50,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:28:50,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:50,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:50,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:50,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:57,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-20 10:28:57,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:28:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:28:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:28:57,297 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-20 10:28:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:57,429 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-20 10:28:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:28:57,430 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-20 10:28:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:57,431 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:28:57,431 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:28:57,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:28:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:28:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-20 10:28:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:28:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-20 10:28:57,434 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-20 10:28:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:57,434 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-20 10:28:57,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:28:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-20 10:28:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:28:57,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:57,435 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-20 10:28:57,435 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-20 10:28:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:57,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:57,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:00,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:00,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:00,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:00,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:00,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:00,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:29:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:00,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:00,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-20 10:29:00,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:00,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:00,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:08,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-20 10:29:08,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:08,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:29:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:29:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:29:08,003 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-20 10:29:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:08,248 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-20 10:29:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:29:08,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-20 10:29:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:08,249 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:29:08,249 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:29:08,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:29:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:29:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 10:29:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:29:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-20 10:29:08,251 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-20 10:29:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:08,251 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-20 10:29:08,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:29:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-20 10:29:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:29:08,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:08,252 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-20 10:29:08,252 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:08,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-20 10:29:08,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:08,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:08,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:11,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:11,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:11,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:11,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:11,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:11,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:29:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:11,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:11,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:11,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:11,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:11,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:19,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:19,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-20 10:29:19,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:19,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 10:29:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 10:29:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:29:19,619 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-20 10:29:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:19,799 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-20 10:29:19,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:29:19,799 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-20 10:29:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:19,800 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:29:19,800 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:29:19,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:29:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:29:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-20 10:29:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-20 10:29:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-20 10:29:19,803 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-20 10:29:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:19,803 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-20 10:29:19,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 10:29:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-20 10:29:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-20 10:29:19,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:19,804 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-20 10:29:19,804 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-20 10:29:19,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:19,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:19,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:19,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:22,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:22,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:22,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:22,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:22,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:22,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:29:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:22,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:22,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:22,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:29,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:29,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-20 10:29:29,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:29,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-20 10:29:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-20 10:29:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:29:29,739 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-20 10:29:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:29,889 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-20 10:29:29,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:29:29,890 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-20 10:29:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:29,890 INFO L225 Difference]: With dead ends: 89 [2019-01-20 10:29:29,890 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:29:29,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:29:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:29:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 10:29:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:29:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-20 10:29:29,894 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-20 10:29:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:29,894 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-20 10:29:29,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-20 10:29:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-20 10:29:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:29:29,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:29,895 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-20 10:29:29,895 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-20 10:29:29,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:29,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:29,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:32,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:32,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:32,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:32,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:32,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:32,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:29:32,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:32,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:33,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-20 10:29:33,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:33,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:33,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:41,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-20 10:29:41,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:41,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:29:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:29:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:29:41,426 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-20 10:29:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:41,587 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-20 10:29:41,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:29:41,587 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-20 10:29:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:41,588 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:29:41,588 INFO L226 Difference]: Without dead ends: 88 [2019-01-20 10:29:41,589 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 [2019-01-20 10:29:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-20 10:29:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-20 10:29:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-20 10:29:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-20 10:29:41,592 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-20 10:29:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:41,592 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-20 10:29:41,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:29:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-20 10:29:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-20 10:29:41,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:41,593 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-20 10:29:41,593 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-20 10:29:41,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:41,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:41,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:41,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:41,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:44,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:44,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:44,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:44,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:44,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:44,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:29:44,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:44,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:44,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:44,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:44,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:44,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:52,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:52,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-20 10:29:52,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:52,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-20 10:29:52,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-20 10:29:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:29:52,343 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-20 10:29:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:52,502 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-20 10:29:52,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:29:52,502 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-20 10:29:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:52,503 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:29:52,503 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:29:52,504 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 [2019-01-20 10:29:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:29:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 10:29:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:29:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-20 10:29:52,507 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-20 10:29:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:52,508 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-20 10:29:52,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-20 10:29:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-20 10:29:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:29:52,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:52,509 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-20 10:29:52,509 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-20 10:29:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:52,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:52,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:55,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:55,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:55,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:55,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:55,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:55,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:29:55,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:55,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:55,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:55,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:03,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:03,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-20 10:30:03,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:03,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:30:03,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:30:03,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:30:03,474 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-20 10:30:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:03,852 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-20 10:30:03,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:30:03,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-20 10:30:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:03,854 INFO L225 Difference]: With dead ends: 92 [2019-01-20 10:30:03,854 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:30:03,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:30:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:30:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-20 10:30:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-20 10:30:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-20 10:30:03,857 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-20 10:30:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:03,857 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-20 10:30:03,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:30:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-20 10:30:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-20 10:30:03,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:03,858 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-20 10:30:03,858 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-20 10:30:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:03,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:06,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:06,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:06,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:06,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:06,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:06,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:30:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:06,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:07,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-20 10:30:07,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:07,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:07,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:16,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:16,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-20 10:30:16,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:16,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:30:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:30:16,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:30:16,176 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-20 10:30:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:16,413 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-20 10:30:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:30:16,413 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-20 10:30:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:16,414 INFO L225 Difference]: With dead ends: 93 [2019-01-20 10:30:16,414 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:30:16,415 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 [2019-01-20 10:30:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:30:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 10:30:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:30:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-20 10:30:16,417 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-20 10:30:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:16,417 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-20 10:30:16,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:30:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-20 10:30:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 10:30:16,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:16,417 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-20 10:30:16,418 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-20 10:30:16,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:16,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:16,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:16,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:19,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:19,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:19,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:19,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:19,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:19,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:30:19,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:19,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:19,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:19,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:19,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:19,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:28,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:28,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-20 10:30:28,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:28,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:30:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:30:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:30:28,049 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-20 10:30:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:28,195 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-20 10:30:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:30:28,195 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-20 10:30:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:28,196 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:30:28,196 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:30:28,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:30:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:30:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-20 10:30:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:30:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-20 10:30:28,199 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-20 10:30:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:28,199 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-20 10:30:28,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:30:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-20 10:30:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-20 10:30:28,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:28,200 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-20 10:30:28,200 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-20 10:30:28,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:28,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:28,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:28,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:28,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:31,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:31,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:31,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:31,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:31,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:31,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:30:31,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:31,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:31,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:31,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:40,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:40,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-20 10:30:40,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:40,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:30:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:30:40,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:30:40,758 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-20 10:30:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:40,993 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-20 10:30:40,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:30:40,994 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-20 10:30:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:40,994 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:30:40,994 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:30:40,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:30:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:30:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 10:30:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:30:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-20 10:30:40,997 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-20 10:30:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:40,998 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-20 10:30:40,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:30:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-20 10:30:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:30:40,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:40,998 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-20 10:30:40,998 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-20 10:30:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:40,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:43,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:43,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:43,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:43,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:43,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:43,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:30:43,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:43,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:45,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-20 10:30:45,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:45,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:45,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:53,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:53,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-20 10:30:53,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:53,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:30:53,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:30:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:30:53,918 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-20 10:30:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:54,069 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-20 10:30:54,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:30:54,069 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-20 10:30:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:54,070 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:30:54,071 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 10:30:54,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:30:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 10:30:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-20 10:30:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-20 10:30:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-20 10:30:54,075 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-20 10:30:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:54,075 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-20 10:30:54,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:30:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-20 10:30:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-20 10:30:54,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:54,076 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-20 10:30:54,076 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-20 10:30:54,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:54,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:54,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:57,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:57,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:57,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:57,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:57,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:57,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:30:57,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:57,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:57,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:57,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:57,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:57,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:06,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:06,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-20 10:31:06,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:06,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-20 10:31:06,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-20 10:31:06,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:31:06,500 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-20 10:31:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:06,762 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-20 10:31:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:31:06,763 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-20 10:31:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:06,763 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:31:06,764 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:31:06,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:31:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:31:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 10:31:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:31:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-20 10:31:06,767 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-20 10:31:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:06,768 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-20 10:31:06,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-20 10:31:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-20 10:31:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 10:31:06,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:06,769 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-20 10:31:06,769 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-20 10:31:06,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:06,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:06,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:09,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:09,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:09,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:09,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:09,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:09,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:31:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:09,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:09,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:09,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:18,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:18,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-20 10:31:18,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:18,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:31:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:31:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:31:18,967 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-20 10:31:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:19,181 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-20 10:31:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:31:19,181 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-20 10:31:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:19,182 INFO L225 Difference]: With dead ends: 98 [2019-01-20 10:31:19,182 INFO L226 Difference]: Without dead ends: 96 [2019-01-20 10:31:19,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:31:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-20 10:31:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-20 10:31:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:31:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-20 10:31:19,185 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-20 10:31:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:19,185 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-20 10:31:19,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:31:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-20 10:31:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 10:31:19,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:19,185 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-20 10:31:19,185 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-20 10:31:19,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:19,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:19,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:19,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:22,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:22,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:22,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:22,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:22,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:22,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:31:22,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:22,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:23,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-20 10:31:23,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:23,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:23,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:33,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:33,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-20 10:31:33,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:33,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:31:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:31:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:31:33,571 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-20 10:31:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:33,737 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-20 10:31:33,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:31:33,737 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-20 10:31:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:33,737 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:31:33,738 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:31:33,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:31:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:31:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 10:31:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:31:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-20 10:31:33,741 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-20 10:31:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:33,741 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-20 10:31:33,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:31:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-20 10:31:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:31:33,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:33,742 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-20 10:31:33,742 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-20 10:31:33,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:33,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:33,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:33,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:33,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:37,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:37,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:37,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:37,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:37,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:37,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:31:37,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:37,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:37,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:37,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:37,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:37,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:46,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-20 10:31:46,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:46,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:31:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:31:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:31:46,525 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-20 10:31:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:46,694 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-20 10:31:46,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:31:46,694 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-20 10:31:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:46,695 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:31:46,695 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:31:46,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:31:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:31:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-20 10:31:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:31:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-20 10:31:46,700 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-20 10:31:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:46,700 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-20 10:31:46,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:31:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-20 10:31:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-20 10:31:46,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:46,701 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-20 10:31:46,701 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:46,701 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-20 10:31:46,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:46,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:46,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:46,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:46,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:50,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:50,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:50,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:50,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:50,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:50,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:31:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:50,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:50,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:50,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:00,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-20 10:32:00,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:00,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-20 10:32:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-20 10:32:00,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:32:00,053 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-20 10:32:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:00,208 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-20 10:32:00,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:32:00,209 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-20 10:32:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:00,209 INFO L225 Difference]: With dead ends: 101 [2019-01-20 10:32:00,209 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:32:00,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:32:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:32:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 10:32:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 10:32:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-20 10:32:00,214 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-20 10:32:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:00,214 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-20 10:32:00,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-20 10:32:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-20 10:32:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 10:32:00,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:00,215 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-20 10:32:00,215 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-20 10:32:00,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:00,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:03,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:03,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:03,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:03,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:03,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:03,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:32:03,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:03,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:05,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-20 10:32:05,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:05,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:05,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:15,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:15,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-20 10:32:15,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:15,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:32:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:32:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:32:15,431 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-20 10:32:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:15,609 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-20 10:32:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:32:15,610 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-20 10:32:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:15,610 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:32:15,611 INFO L226 Difference]: Without dead ends: 100 [2019-01-20 10:32:15,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:32:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-20 10:32:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-20 10:32:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:32:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-20 10:32:15,614 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-20 10:32:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:15,614 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-20 10:32:15,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:32:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-20 10:32:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-20 10:32:15,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:15,615 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-20 10:32:15,615 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-20 10:32:15,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:15,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:15,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:19,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:19,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:19,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:19,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:19,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:19,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:32:19,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:19,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:19,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:19,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:19,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:19,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-20 10:32:29,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:29,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-20 10:32:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-20 10:32:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:32:29,514 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-20 10:32:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:29,738 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-20 10:32:29,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:32:29,739 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-20 10:32:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:29,739 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:32:29,739 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:32:29,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:32:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:32:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 10:32:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:32:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-20 10:32:29,743 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-20 10:32:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:29,743 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-20 10:32:29,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-20 10:32:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-20 10:32:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:32:29,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:29,744 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-20 10:32:29,744 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-20 10:32:29,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:29,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:29,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:29,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:29,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:33,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:33,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:33,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:33,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:33,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:33,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:32:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:33,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:33,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:33,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:43,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:43,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-20 10:32:43,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:43,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:32:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:32:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:32:43,929 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-20 10:32:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:44,252 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-20 10:32:44,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:32:44,252 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-20 10:32:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:44,253 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:32:44,253 INFO L226 Difference]: Without dead ends: 102 [2019-01-20 10:32:44,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:32:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-20 10:32:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-20 10:32:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:32:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-20 10:32:44,257 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-20 10:32:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:44,257 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-20 10:32:44,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:32:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-20 10:32:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-20 10:32:44,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:44,257 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-20 10:32:44,258 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:44,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-20 10:32:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:44,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:47,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:47,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:47,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:47,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:47,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:32:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:47,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:49,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-20 10:32:49,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:49,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:49,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:59,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-20 10:32:59,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:32:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:32:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:32:59,833 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-20 10:33:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:00,076 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-20 10:33:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:33:00,077 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-20 10:33:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:00,077 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:33:00,078 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:33:00,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:33:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:33:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 10:33:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:33:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-20 10:33:00,082 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-20 10:33:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:00,082 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-20 10:33:00,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:33:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-20 10:33:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 10:33:00,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:00,082 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-20 10:33:00,083 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-20 10:33:00,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:00,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:00,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:03,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:03,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:03,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:03,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:03,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:03,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:33:03,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:03,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:03,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:03,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:03,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:03,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:14,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:14,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-20 10:33:14,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:14,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:33:14,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:33:14,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:33:14,933 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-20 10:33:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:15,216 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-20 10:33:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-20 10:33:15,217 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-20 10:33:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:15,217 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:33:15,218 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:33:15,219 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 [2019-01-20 10:33:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:33:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-20 10:33:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:33:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-20 10:33:15,222 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-20 10:33:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-20 10:33:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:33:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-20 10:33:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-20 10:33:15,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:15,223 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-20 10:33:15,223 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-20 10:33:15,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:15,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:15,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:18,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:18,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:18,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:18,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:18,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:18,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:33:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:18,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:33:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:18,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:18,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:30,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:30,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-20 10:33:30,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:30,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-20 10:33:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-20 10:33:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:33:30,239 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-20 10:33:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:30,421 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-20 10:33:30,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:33:30,422 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-20 10:33:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:30,423 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:33:30,423 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:33:30,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:33:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:33:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 10:33:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:33:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-20 10:33:30,429 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-20 10:33:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:30,429 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-20 10:33:30,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-20 10:33:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-20 10:33:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:33:30,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:30,430 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-20 10:33:30,430 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-20 10:33:30,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:34,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:34,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:34,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:34,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:34,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:34,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:33:34,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:33:34,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:36,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-20 10:33:36,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:36,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:36,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:47,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:47,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-20 10:33:47,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:47,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:33:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:33:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:33:47,449 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-20 10:33:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:47,799 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-20 10:33:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:33:47,800 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-20 10:33:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:47,801 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:33:47,801 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:33:47,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:33:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:33:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-20 10:33:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 10:33:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-20 10:33:47,806 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-20 10:33:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:47,806 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-20 10:33:47,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:33:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-20 10:33:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-20 10:33:47,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:47,807 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-20 10:33:47,807 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-20 10:33:47,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:47,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:47,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:51,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:51,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:51,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:51,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:51,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:51,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:33:51,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:51,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:52,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:52,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:52,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:52,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:03,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-20 10:34:03,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:03,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:34:03,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:34:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:34:03,533 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-20 10:34:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:03,836 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-20 10:34:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:34:03,837 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-20 10:34:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:03,837 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:34:03,837 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:34:03,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:34:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:34:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 10:34:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:34:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-20 10:34:03,841 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-20 10:34:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:03,842 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-20 10:34:03,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:34:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-20 10:34:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 10:34:03,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:03,843 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-20 10:34:03,843 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-20 10:34:03,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:03,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:03,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:07,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:07,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:07,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:07,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:34:07,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:07,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:07,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:08,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:19,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:19,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-20 10:34:19,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:19,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:34:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:34:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:34:19,613 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-20 10:34:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:19,851 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-20 10:34:19,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-20 10:34:19,858 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-20 10:34:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:19,859 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:34:19,859 INFO L226 Difference]: Without dead ends: 108 [2019-01-20 10:34:19,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:34:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-20 10:34:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-20 10:34:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:34:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-20 10:34:19,862 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-20 10:34:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:19,862 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-20 10:34:19,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:34:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-20 10:34:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 10:34:19,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:19,863 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-20 10:34:19,863 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-20 10:34:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:19,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:19,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:23,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:23,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:23,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:23,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:23,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:23,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:34:24,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:24,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:26,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-20 10:34:26,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:26,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:26,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:37,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:37,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-20 10:34:37,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:37,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:34:37,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:34:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:34:37,895 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-20 10:34:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:38,129 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-20 10:34:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-20 10:34:38,129 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-20 10:34:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:38,129 INFO L225 Difference]: With dead ends: 111 [2019-01-20 10:34:38,130 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:34:38,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:34:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:34:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-20 10:34:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 10:34:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-20 10:34:38,134 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-20 10:34:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:38,134 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-20 10:34:38,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:34:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-20 10:34:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 10:34:38,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:38,135 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-20 10:34:38,135 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-20 10:34:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:38,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:38,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:38,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:42,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:42,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:42,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:42,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:42,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:42,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:34:42,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:34:42,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:34:42,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:34:42,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:42,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:42,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:54,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:54,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-20 10:34:54,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:54,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-20 10:34:54,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-20 10:34:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:34:54,578 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-20 10:34:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:54,843 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-20 10:34:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-20 10:34:54,843 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-20 10:34:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:54,844 INFO L225 Difference]: With dead ends: 112 [2019-01-20 10:34:54,844 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:34:54,846 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 [2019-01-20 10:34:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:34:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-20 10:34:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-20 10:34:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-20 10:34:54,848 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-20 10:34:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:54,848 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-20 10:34:54,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-20 10:34:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-20 10:34:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-20 10:34:54,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:54,849 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-20 10:34:54,849 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-20 10:34:54,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:54,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:54,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:59,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:59,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:59,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:59,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:59,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:59,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:34:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:59,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:59,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:59,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:11,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:11,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-20 10:35:11,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:11,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-20 10:35:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-20 10:35:11,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:35:11,541 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-20 10:35:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:11,833 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-20 10:35:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-20 10:35:11,833 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-20 10:35:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:11,834 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:35:11,834 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:35:11,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:35:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:35:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-20 10:35:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:35:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-20 10:35:11,838 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-20 10:35:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:11,838 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-20 10:35:11,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-20 10:35:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-20 10:35:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 10:35:11,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:11,839 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-20 10:35:11,839 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:11,840 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-20 10:35:11,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:11,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:11,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:15,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:15,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:15,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:15,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:15,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:15,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:35:15,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:35:15,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:35:18,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-20 10:35:18,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:18,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:18,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:31,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:31,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-20 10:35:31,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:31,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-20 10:35:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-20 10:35:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:35:31,132 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-20 10:35:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:31,476 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-20 10:35:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-20 10:35:31,477 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-20 10:35:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:31,477 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:35:31,477 INFO L226 Difference]: Without dead ends: 112 [2019-01-20 10:35:31,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:35:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-20 10:35:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-20 10:35:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-20 10:35:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-20 10:35:31,480 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-20 10:35:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:31,480 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-20 10:35:31,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-20 10:35:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-20 10:35:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-20 10:35:31,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:31,481 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-20 10:35:31,481 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-20 10:35:31,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:31,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:31,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:31,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:35,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:35,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:35,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:35,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:35,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:35,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:35:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:35:35,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:35:35,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:35:35,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:35,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:35,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:48,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-20 10:35:48,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:48,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-20 10:35:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-20 10:35:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-20 10:35:48,856 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-20 10:35:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:49,138 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-20 10:35:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-20 10:35:49,139 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-20 10:35:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:49,140 INFO L225 Difference]: With dead ends: 115 [2019-01-20 10:35:49,140 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:35:49,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-20 10:35:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:35:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-20 10:35:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 10:35:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-20 10:35:49,145 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-20 10:35:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:49,145 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-20 10:35:49,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-20 10:35:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-20 10:35:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-20 10:35:49,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:49,146 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-20 10:35:49,147 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:49,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-20 10:35:49,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:49,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:49,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:49,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:49,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:53,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:53,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:53,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:53,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:53,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:53,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:35:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:53,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:35:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:53,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:53,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:06,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:06,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-20 10:36:06,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:06,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:36:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:36:06,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-20 10:36:06,674 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-20 10:36:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:06,918 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-20 10:36:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-20 10:36:06,919 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-20 10:36:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:06,919 INFO L225 Difference]: With dead ends: 116 [2019-01-20 10:36:06,919 INFO L226 Difference]: Without dead ends: 114 [2019-01-20 10:36:06,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-20 10:36:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-20 10:36:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-20 10:36:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-20 10:36:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-20 10:36:06,924 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-20 10:36:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:06,925 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-20 10:36:06,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:36:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-20 10:36:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-20 10:36:06,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:06,925 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-20 10:36:06,926 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-20 10:36:06,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:06,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:06,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:06,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:06,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:11,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:11,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:11,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:11,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:11,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:11,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-20 10:36:11,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:36:11,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:36:14,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-20 10:36:14,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:14,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:14,099 INFO L316 TraceCheckSpWp]: Computing backward predicates...