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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:21:02,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:21:02,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:21:02,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:21:02,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:21:02,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:21:02,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:21:02,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:21:02,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:21:02,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:21:02,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:21:02,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:21:02,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:21:02,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:21:02,201 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:21:02,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:21:02,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:21:02,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:21:02,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:21:02,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:21:02,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:21:02,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:21:02,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:21:02,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:21:02,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:21:02,228 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:21:02,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:21:02,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:21:02,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:21:02,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:21:02,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:21:02,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:21:02,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:21:02,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:21:02,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:21:02,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:21:02,239 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-31 17:21:02,250 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:21:02,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:21:02,251 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:21:02,252 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:21:02,252 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:21:02,252 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:21:02,252 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:21:02,252 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:21:02,253 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:21:02,253 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:21:02,253 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:21:02,253 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:21:02,253 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:21:02,254 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:21:02,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:21:02,255 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:21:02,255 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:21:02,255 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:21:02,255 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:21:02,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:21:02,256 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:21:02,256 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:21:02,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:21:02,256 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:21:02,257 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:21:02,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:21:02,257 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:21:02,257 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:21:02,257 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:21:02,258 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:21:02,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,258 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:21:02,258 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:21:02,259 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:21:02,259 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:21:02,259 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:21:02,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:21:02,259 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:21:02,260 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:21:02,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:21:02,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:21:02,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:21:02,313 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:21:02,314 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:21:02,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-01-31 17:21:02,315 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-01-31 17:21:02,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:21:02,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:21:02,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:21:02,360 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:21:02,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,393 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 17:21:02,393 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 17:21:02,393 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 17:21:02,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:21:02,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:21:02,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:21:02,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:21:02,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:21:02,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,485 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 17:21:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 17:21:02,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 17:21:02,723 INFO L278 CfgBuilder]: Using library mode [2019-01-31 17:21:02,723 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 17:21:02,725 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02 BoogieIcfgContainer [2019-01-31 17:21:02,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:21:02,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:21:02,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:21:02,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:21:02,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/2) ... [2019-01-31 17:21:02,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10966db8 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:21:02, skipping insertion in model container [2019-01-31 17:21:02,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02" (2/2) ... [2019-01-31 17:21:02,734 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-01-31 17:21:02,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:21:02,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 17:21:02,773 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 17:21:02,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:21:02,801 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:21:02,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:21:02,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:21:02,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:21:02,802 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:21:02,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:21:02,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:21:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 17:21:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:21:02,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:02,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:21:02,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-01-31 17:21:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:02,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:03,331 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-31 17:21:03,401 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-31 17:21:03,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:21:03,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:03,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:03,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:21:03,421 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-31 17:21:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:03,537 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-31 17:21:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:21:03,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:21:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:03,552 INFO L225 Difference]: With dead ends: 14 [2019-01-31 17:21:03,552 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 17:21:03,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:21:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 17:21:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-31 17:21:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 17:21:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 17:21:03,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-01-31 17:21:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:03,592 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 17:21:03,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 17:21:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:21:03,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:03,593 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:21:03,594 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:03,594 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-01-31 17:21:03,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:03,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:03,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:04,037 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-31 17:21:04,217 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-31 17:21:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:04,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:04,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:04,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:21:04,319 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-01-31 17:21:04,376 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:04,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:05,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:05,026 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:21:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:05,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:05,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:05,040 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-31 17:21:05,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:05,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:05,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:05,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:05,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:05,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:05,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:05,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:05,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:05,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:05,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:05,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:21:05,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:05,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:21:05,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:21:05,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:21:05,850 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-01-31 17:21:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,129 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 17:21:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:21:06,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:21:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,132 INFO L225 Difference]: With dead ends: 10 [2019-01-31 17:21:06,132 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 17:21:06,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:21:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 17:21:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-31 17:21:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:21:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 17:21:06,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-31 17:21:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,137 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 17:21:06,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:21:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 17:21:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:21:06,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,138 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-01-31 17:21:06,138 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-01-31 17:21:06,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,437 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-31 17:21:06,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:06,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:06,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:06,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,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 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-31 17:21:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:06,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:06,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:21:06,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:06,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:06,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:06,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:06,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:06,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:06,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:06,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:06,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:06,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:06,580 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-31 17:21:06,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:06,802 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-31 17:21:06,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:06,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:21:06,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:06,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:21:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:21:06,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:06,824 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-01-31 17:21:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,892 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 17:21:06,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:21:06,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:21:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,893 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:21:06,894 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:21:06,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:21:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-31 17:21:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:21:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-31 17:21:06,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-01-31 17:21:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,898 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-31 17:21:06,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:21:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 17:21:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:21:06,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,899 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-01-31 17:21:06,899 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-01-31 17:21:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:07,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:07,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:07,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,225 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-31 17:21:07,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:07,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:07,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:07,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:07,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:07,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:07,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:07,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:07,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:07,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:07,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:07,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:07,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:07,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:21:07,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:07,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:21:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:21:07,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:21:07,706 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-01-31 17:21:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:07,822 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-31 17:21:07,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:21:07,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:21:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:07,824 INFO L225 Difference]: With dead ends: 14 [2019-01-31 17:21:07,825 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 17:21:07,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:21:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 17:21:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-31 17:21:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:21:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-31 17:21:07,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-31 17:21:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:07,829 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-31 17:21:07,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:21:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 17:21:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 17:21:07,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:07,830 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-01-31 17:21:07,830 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-01-31 17:21:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:07,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:08,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:08,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:08,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,206 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-31 17:21:08,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:08,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:08,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:08,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:08,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:08,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:08,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:08,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:08,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:08,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-01-31 17:21:08,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 17:21:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 17:21:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:08,614 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-01-31 17:21:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:09,084 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-31 17:21:09,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:21:09,085 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-01-31 17:21:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:09,085 INFO L225 Difference]: With dead ends: 16 [2019-01-31 17:21:09,085 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 17:21:09,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 17:21:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-31 17:21:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:21:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-31 17:21:09,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-31 17:21:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:09,090 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-31 17:21:09,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 17:21:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-31 17:21:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-31 17:21:09,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:09,091 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-01-31 17:21:09,091 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-01-31 17:21:09,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,412 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-31 17:21:09,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:09,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:09,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-31 17:21:09,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:09,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:09,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:09,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:09,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:09,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:09,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:09,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:09,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-01-31 17:21:09,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 17:21:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 17:21:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-31 17:21:09,917 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-01-31 17:21:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:10,042 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-31 17:21:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:21:10,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-01-31 17:21:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:10,044 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:21:10,044 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:21:10,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-31 17:21:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:21:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-31 17:21:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:21:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-31 17:21:10,048 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-01-31 17:21:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:10,049 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-31 17:21:10,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 17:21:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-31 17:21:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-31 17:21:10,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:10,051 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-01-31 17:21:10,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-01-31 17:21:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:10,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:10,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:10,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:10,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,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 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-31 17:21:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:10,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:10,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:10,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:10,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:10,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:10,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:10,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:10,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:10,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:10,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:10,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:10,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:10,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:11,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-01-31 17:21:11,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:11,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 17:21:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 17:21:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:11,011 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-01-31 17:21:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:11,279 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-31 17:21:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:21:11,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-01-31 17:21:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:11,280 INFO L225 Difference]: With dead ends: 20 [2019-01-31 17:21:11,280 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:21:11,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:21:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-31 17:21:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:21:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-31 17:21:11,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-01-31 17:21:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:11,286 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-31 17:21:11,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 17:21:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-31 17:21:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-31 17:21:11,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:11,287 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-01-31 17:21:11,287 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-01-31 17:21:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:11,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:11,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:11,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,646 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-31 17:21:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:11,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:11,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:11,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:11,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:11,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:11,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:11,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:11,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:11,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:12,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:12,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-01-31 17:21:12,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:12,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 17:21:12,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 17:21:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-31 17:21:12,195 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-01-31 17:21:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:12,712 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-31 17:21:12,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:21:12,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-01-31 17:21:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:12,713 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:21:12,713 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:21:12,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-31 17:21:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:21:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-31 17:21:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:21:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-31 17:21:12,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-01-31 17:21:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:12,718 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-31 17:21:12,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 17:21:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-31 17:21:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-31 17:21:12,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:12,719 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-01-31 17:21:12,720 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-01-31 17:21:12,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,983 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:21:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:13,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:13,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:13,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:13,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:13,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:13,275 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-31 17:21:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:13,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:13,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-31 17:21:13,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:13,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:13,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:13,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:13,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:13,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:13,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:13,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:13,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:13,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:13,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:14,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-01-31 17:21:14,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:14,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 17:21:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 17:21:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:14,002 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-01-31 17:21:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:14,333 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-31 17:21:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:21:14,335 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-01-31 17:21:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:14,336 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:21:14,336 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:21:14,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:21:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-31 17:21:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:21:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-31 17:21:14,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-01-31 17:21:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:14,342 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-31 17:21:14,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 17:21:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-31 17:21:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-31 17:21:14,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:14,344 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-01-31 17:21:14,344 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-01-31 17:21:14,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:14,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:14,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:14,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:14,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:14,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:14,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:14,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:14,736 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-31 17:21:14,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:14,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:14,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:14,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:14,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:14,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:14,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:14,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:14,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:15,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:15,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:15,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:15,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:15,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:15,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:15,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-01-31 17:21:15,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:15,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 17:21:15,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 17:21:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-31 17:21:15,771 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-01-31 17:21:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:16,057 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-31 17:21:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 17:21:16,057 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-01-31 17:21:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:16,058 INFO L225 Difference]: With dead ends: 26 [2019-01-31 17:21:16,059 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 17:21:16,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-31 17:21:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 17:21:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-31 17:21:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:21:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-31 17:21:16,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-01-31 17:21:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:16,066 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-31 17:21:16,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 17:21:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-31 17:21:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-31 17:21:16,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:16,066 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-01-31 17:21:16,067 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-01-31 17:21:16,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:16,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:16,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:16,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:16,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:16,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:16,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:16,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:16,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 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-31 17:21:16,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:16,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:16,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:16,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:16,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:16,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:16,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:16,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:16,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:16,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:16,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:16,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:17,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:17,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-01-31 17:21:17,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:17,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 17:21:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 17:21:17,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:17,411 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-01-31 17:21:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:17,697 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-31 17:21:17,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 17:21:17,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-01-31 17:21:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:17,699 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:21:17,699 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 17:21:17,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 17:21:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-31 17:21:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:21:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-31 17:21:17,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-01-31 17:21:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:17,706 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-31 17:21:17,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 17:21:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-31 17:21:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-31 17:21:17,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:17,707 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-01-31 17:21:17,708 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-01-31 17:21:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:17,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:17,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:18,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:18,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:18,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:18,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:18,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:18,225 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-31 17:21:18,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:18,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:18,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-31 17:21:18,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:18,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:18,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:18,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:18,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:18,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:18,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:18,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:18,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:18,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:18,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:19,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:19,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-01-31 17:21:19,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:19,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 17:21:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 17:21:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-31 17:21:19,159 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-01-31 17:21:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:19,505 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-31 17:21:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 17:21:19,506 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-01-31 17:21:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:19,507 INFO L225 Difference]: With dead ends: 30 [2019-01-31 17:21:19,507 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:21:19,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-31 17:21:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:21:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-31 17:21:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:21:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-31 17:21:19,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-01-31 17:21:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:19,514 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-31 17:21:19,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 17:21:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-31 17:21:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-31 17:21:19,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:19,515 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-01-31 17:21:19,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:19,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:19,515 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-01-31 17:21:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:19,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:19,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:20,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:20,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:20,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:20,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:20,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:20,004 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-31 17:21:20,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:20,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:20,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:20,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:20,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:20,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:20,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:20,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:20,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:20,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:20,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:20,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:20,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:20,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:21,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:21,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-01-31 17:21:21,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:21,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 17:21:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 17:21:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:21,303 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-01-31 17:21:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:21,818 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-31 17:21:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 17:21:21,819 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-01-31 17:21:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:21,820 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:21:21,820 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:21:21,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:21:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-31 17:21:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:21:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-31 17:21:21,826 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-01-31 17:21:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:21,826 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-31 17:21:21,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 17:21:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-31 17:21:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-31 17:21:21,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:21,827 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-01-31 17:21:21,828 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-01-31 17:21:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:22,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:22,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:22,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:22,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,369 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-31 17:21:22,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:22,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:22,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:22,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:22,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:22,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:22,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:22,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:22,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:22,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:22,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:22,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:23,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:23,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-01-31 17:21:23,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:23,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 17:21:23,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 17:21:23,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-31 17:21:23,438 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-01-31 17:21:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:24,208 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-31 17:21:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 17:21:24,209 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-01-31 17:21:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:24,210 INFO L225 Difference]: With dead ends: 34 [2019-01-31 17:21:24,210 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:21:24,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-31 17:21:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:21:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-31 17:21:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:21:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-31 17:21:24,217 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-01-31 17:21:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:24,217 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-31 17:21:24,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 17:21:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-31 17:21:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-31 17:21:24,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:24,219 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-01-31 17:21:24,219 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:24,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-01-31 17:21:24,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:24,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:24,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:24,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:24,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:24,479 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:21:24,724 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:21:25,759 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-31 17:21:25,767 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-31 17:21:25,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:25,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:25,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:25,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,768 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-31 17:21:25,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:25,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:25,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-31 17:21:25,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:25,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:25,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:25,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:25,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:25,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:26,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:26,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:26,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:26,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:26,361 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-31 17:21:26,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:27,504 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-31 17:21:27,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:27,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-01-31 17:21:27,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:27,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 17:21:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 17:21:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:27,526 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-01-31 17:21:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:28,176 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-31 17:21:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 17:21:28,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-01-31 17:21:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:28,177 INFO L225 Difference]: With dead ends: 36 [2019-01-31 17:21:28,177 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:21:28,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:21:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-31 17:21:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 17:21:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-31 17:21:28,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-01-31 17:21:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:28,184 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-31 17:21:28,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 17:21:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-31 17:21:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-31 17:21:28,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:28,185 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-01-31 17:21:28,185 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-01-31 17:21:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:28,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:28,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:28,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:28,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:28,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:28,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,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 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-31 17:21:28,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:28,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:28,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:28,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:28,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:28,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:28,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:28,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:28,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:29,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:29,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:29,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:29,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:29,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:31,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:31,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-01-31 17:21:31,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:31,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 17:21:31,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 17:21:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-31 17:21:31,227 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-01-31 17:21:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:31,724 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-31 17:21:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 17:21:31,725 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-01-31 17:21:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:31,725 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:21:31,726 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:21:31,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-31 17:21:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:21:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-31 17:21:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:21:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-31 17:21:31,731 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-01-31 17:21:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:31,732 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-31 17:21:31,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 17:21:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-31 17:21:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-31 17:21:31,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:31,733 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-01-31 17:21:31,733 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-01-31 17:21:31,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:31,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:31,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:31,982 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:21:32,220 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:21:32,474 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:21:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:33,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:33,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:33,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:33,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:33,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:33,227 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-31 17:21:33,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:33,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:33,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:33,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:33,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:33,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:33,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:33,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:33,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:33,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:33,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:33,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:34,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:34,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-01-31 17:21:34,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:34,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 17:21:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 17:21:34,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:34,749 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-01-31 17:21:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:35,670 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-31 17:21:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 17:21:35,671 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-01-31 17:21:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:35,671 INFO L225 Difference]: With dead ends: 40 [2019-01-31 17:21:35,672 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 17:21:35,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 17:21:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-31 17:21:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:21:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-31 17:21:35,679 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-01-31 17:21:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:35,680 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-31 17:21:35,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 17:21:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-31 17:21:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-31 17:21:35,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:35,680 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-01-31 17:21:35,681 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:35,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-01-31 17:21:35,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:35,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:35,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:35,978 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:21:36,236 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:21:36,522 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:21:36,811 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:21:37,146 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:21:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:37,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:37,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:37,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:37,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:37,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:37,703 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-31 17:21:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:37,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:37,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-31 17:21:37,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:37,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:37,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:37,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:37,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:37,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:38,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:38,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:38,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:38,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:38,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:39,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:39,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-01-31 17:21:39,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:39,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 17:21:39,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 17:21:39,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-31 17:21:39,418 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-01-31 17:21:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:40,260 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-31 17:21:40,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 17:21:40,260 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-01-31 17:21:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:40,261 INFO L225 Difference]: With dead ends: 42 [2019-01-31 17:21:40,261 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:21:40,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-31 17:21:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:21:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-31 17:21:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:21:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-31 17:21:40,268 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-01-31 17:21:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:40,269 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-31 17:21:40,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 17:21:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-31 17:21:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-31 17:21:40,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:40,270 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-01-31 17:21:40,270 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:40,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-01-31 17:21:40,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:40,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:40,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:41,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:41,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:41,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:41,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:41,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:41,110 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-31 17:21:41,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:41,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:41,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:41,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:41,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:41,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:41,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:41,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:41,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:41,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:41,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:41,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:41,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:41,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:42,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:42,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-01-31 17:21:42,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:42,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 17:21:42,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 17:21:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:42,873 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-01-31 17:21:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:43,875 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-31 17:21:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 17:21:43,875 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-01-31 17:21:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:43,876 INFO L225 Difference]: With dead ends: 44 [2019-01-31 17:21:43,877 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 17:21:43,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 17:21:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-31 17:21:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 17:21:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-31 17:21:43,883 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-01-31 17:21:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:43,883 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-31 17:21:43,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 17:21:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-31 17:21:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-31 17:21:43,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:43,884 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-01-31 17:21:43,884 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-01-31 17:21:43,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:44,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:44,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:44,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:44,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:44,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:44,806 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-31 17:21:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:44,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:44,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:44,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:44,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:44,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:44,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:45,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:45,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:45,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:45,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:45,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:46,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-01-31 17:21:46,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:46,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 17:21:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 17:21:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-31 17:21:46,807 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-01-31 17:21:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:47,678 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-31 17:21:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 17:21:47,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-01-31 17:21:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:47,679 INFO L225 Difference]: With dead ends: 46 [2019-01-31 17:21:47,679 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:21:47,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-31 17:21:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:21:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-31 17:21:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-31 17:21:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-31 17:21:47,686 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-01-31 17:21:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:47,686 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-31 17:21:47,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 17:21:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-31 17:21:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-31 17:21:47,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:47,687 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-01-31 17:21:47,687 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-01-31 17:21:47,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:47,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:47,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:48,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:48,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:21:48,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:48,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:48,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-31 17:21:48,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:48,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:48,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:48,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:48,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:48,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:49,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:49,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:49,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:49,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:49,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-01-31 17:21:50,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:50,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:21:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:21:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:50,518 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-01-31 17:21:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:51,595 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-31 17:21:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 17:21:51,601 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-01-31 17:21:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:51,601 INFO L225 Difference]: With dead ends: 48 [2019-01-31 17:21:51,602 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:21:51,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:21:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-31 17:21:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:21:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-31 17:21:51,607 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-01-31 17:21:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:51,607 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-31 17:21:51,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:21:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-31 17:21:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-31 17:21:51,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:51,608 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-01-31 17:21:51,608 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-01-31 17:21:51,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:51,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:52,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:52,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:52,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:52,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:52,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:52,431 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-31 17:21:52,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:52,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:52,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:52,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:52,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:52,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:52,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:52,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:52,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:53,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:53,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:53,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:53,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:53,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:54,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:54,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-01-31 17:21:54,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:54,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 17:21:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 17:21:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-31 17:21:54,710 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-01-31 17:21:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:55,798 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-31 17:21:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 17:21:55,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-01-31 17:21:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:55,800 INFO L225 Difference]: With dead ends: 50 [2019-01-31 17:21:55,800 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 17:21:55,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-31 17:21:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 17:21:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-31 17:21:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:21:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-31 17:21:55,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-01-31 17:21:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:55,805 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-31 17:21:55,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 17:21:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-31 17:21:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-31 17:21:55,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:55,806 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-01-31 17:21:55,806 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-01-31 17:21:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:56,084 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:21:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:56,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:56,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:56,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:56,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:56,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:56,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 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-31 17:21:56,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:56,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:56,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:56,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:21:56,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:56,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:56,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:21:57,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:21:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:57,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:57,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:21:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:57,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:59,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:59,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-01-31 17:21:59,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:59,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 17:21:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 17:21:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:21:59,337 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-01-31 17:22:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:00,490 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-31 17:22:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 17:22:00,490 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-01-31 17:22:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:00,491 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:22:00,491 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:22:00,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:22:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:22:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-01-31 17:22:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:22:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-31 17:22:00,497 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-01-31 17:22:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:00,498 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-31 17:22:00,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 17:22:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-31 17:22:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-31 17:22:00,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:00,499 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-01-31 17:22:00,499 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-01-31 17:22:00,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:00,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:00,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:01,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:01,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:01,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:01,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:22:01,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:01,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:01,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-31 17:22:01,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:01,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:01,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:01,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:01,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:01,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:02,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:02,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:02,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:02,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:02,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:04,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:04,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-01-31 17:22:04,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:04,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:22:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:22:04,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-31 17:22:04,032 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-01-31 17:22:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:05,488 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-31 17:22:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 17:22:05,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-01-31 17:22:05,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:05,489 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:22:05,490 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:22:05,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-31 17:22:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:22:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-31 17:22:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 17:22:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-31 17:22:05,496 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-01-31 17:22:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:05,496 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-31 17:22:05,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:22:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-31 17:22:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 17:22:05,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:05,497 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-01-31 17:22:05,498 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-01-31 17:22:05,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:05,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:05,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:06,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:06,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:06,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:06,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:06,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:06,516 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-31 17:22:06,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:06,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:06,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:06,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:06,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:06,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:06,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:06,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:07,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:07,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:07,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:07,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:07,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:10,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:10,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-01-31 17:22:10,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:10,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 17:22:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 17:22:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 17:22:10,547 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-01-31 17:22:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:11,911 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-31 17:22:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 17:22:11,912 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-01-31 17:22:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:11,913 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:22:11,913 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:22:11,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 17:22:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:22:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-01-31 17:22:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 17:22:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-31 17:22:11,918 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-01-31 17:22:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:11,918 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-31 17:22:11,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 17:22:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-31 17:22:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-31 17:22:11,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:11,919 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-01-31 17:22:11,920 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-01-31 17:22:11,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:11,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:11,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:11,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:11,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:12,141 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:22:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:12,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:12,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:12,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:12,953 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-31 17:22:12,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:12,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:12,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:12,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:12,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:12,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:13,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:14,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:14,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:14,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:14,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:14,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:15,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:15,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-01-31 17:22:15,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:15,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-31 17:22:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-31 17:22:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-31 17:22:15,954 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-01-31 17:22:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:17,316 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-31 17:22:17,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 17:22:17,316 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-01-31 17:22:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:17,317 INFO L225 Difference]: With dead ends: 58 [2019-01-31 17:22:17,317 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:22:17,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-31 17:22:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:22:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-31 17:22:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 17:22:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-31 17:22:17,323 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-01-31 17:22:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:17,323 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-31 17:22:17,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-31 17:22:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-31 17:22:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 17:22:17,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:17,324 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-01-31 17:22:17,324 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-01-31 17:22:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:17,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:17,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:17,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:18,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:18,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:18,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:18,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:18,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:18,376 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-31 17:22:18,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:18,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:18,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-31 17:22:18,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:18,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:18,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:18,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:18,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:18,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:19,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:19,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:19,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:19,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:19,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:21,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:21,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-01-31 17:22:21,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:21,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 17:22:21,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 17:22:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:21,540 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-01-31 17:22:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:23,480 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-31 17:22:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 17:22:23,480 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-01-31 17:22:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:23,481 INFO L225 Difference]: With dead ends: 60 [2019-01-31 17:22:23,481 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 17:22:23,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 17:22:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-31 17:22:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:22:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-31 17:22:23,487 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-01-31 17:22:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:23,487 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-31 17:22:23,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 17:22:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-31 17:22:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-31 17:22:23,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:23,488 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-01-31 17:22:23,488 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-01-31 17:22:23,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:23,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:23,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:24,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:24,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:24,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:24,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:24,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:24,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 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-31 17:22:24,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:24,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:24,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:24,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:24,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:24,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:24,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:24,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:24,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:25,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:25,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:25,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:25,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:25,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:28,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:28,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-01-31 17:22:28,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:28,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-31 17:22:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-31 17:22:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-31 17:22:28,136 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-01-31 17:22:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:29,614 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-31 17:22:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 17:22:29,614 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-01-31 17:22:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:29,615 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:22:29,615 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:22:29,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-31 17:22:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:22:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-01-31 17:22:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 17:22:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-31 17:22:29,620 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-01-31 17:22:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:29,621 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-31 17:22:29,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-31 17:22:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-31 17:22:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-31 17:22:29,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:29,621 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-01-31 17:22:29,622 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-01-31 17:22:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:29,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:29,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:30,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:30,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:30,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:30,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:30,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:30,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 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-31 17:22:30,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:30,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:30,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:30,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:30,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:30,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:30,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:32,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:32,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:32,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:32,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:32,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-01-31 17:22:34,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:34,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-31 17:22:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-31 17:22:34,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:34,413 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-01-31 17:22:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:35,905 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-31 17:22:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 17:22:35,906 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-01-31 17:22:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:35,907 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:22:35,907 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 17:22:35,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 17:22:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-31 17:22:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 17:22:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-31 17:22:35,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-01-31 17:22:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:35,912 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-31 17:22:35,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-31 17:22:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-31 17:22:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-31 17:22:35,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:35,913 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-01-31 17:22:35,913 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-01-31 17:22:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:35,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:36,085 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:22:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:37,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:37,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:37,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:37,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:37,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:37,056 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-31 17:22:37,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:37,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:37,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-31 17:22:37,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:37,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:37,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:37,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:37,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:37,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:38,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:38,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:38,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:38,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:38,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:41,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:41,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-01-31 17:22:41,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:41,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 17:22:41,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 17:22:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-31 17:22:41,131 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-01-31 17:22:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:43,189 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-31 17:22:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 17:22:43,190 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-01-31 17:22:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:43,191 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:22:43,191 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:22:43,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-31 17:22:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:22:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-31 17:22:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 17:22:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-31 17:22:43,195 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-01-31 17:22:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:43,196 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-31 17:22:43,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 17:22:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-31 17:22:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-31 17:22:43,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:43,196 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-01-31 17:22:43,196 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-01-31 17:22:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:43,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:43,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:43,481 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:22:43,689 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:22:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:44,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:44,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:44,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:44,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:44,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:44,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:22:44,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:44,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:44,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:44,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:44,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:44,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:44,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:44,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:44,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:46,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:46,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:46,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:46,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:46,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:49,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:49,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-01-31 17:22:49,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:49,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-31 17:22:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-31 17:22:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:49,102 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-01-31 17:22:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:50,798 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-31 17:22:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 17:22:50,798 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-01-31 17:22:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:50,799 INFO L225 Difference]: With dead ends: 68 [2019-01-31 17:22:50,799 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:22:50,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:22:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-31 17:22:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:22:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-31 17:22:50,805 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-01-31 17:22:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:50,805 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-31 17:22:50,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-31 17:22:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-31 17:22:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-31 17:22:50,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:50,806 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-01-31 17:22:50,806 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-01-31 17:22:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:50,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:50,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:51,019 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:22:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:52,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:52,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:52,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:52,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:52,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:52,101 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-31 17:22:52,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:52,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:52,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:52,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:22:52,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:52,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:52,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:22:54,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:22:54,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:22:54,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:22:54,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:22:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:54,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:56,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:56,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-01-31 17:22:56,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:56,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-31 17:22:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-31 17:22:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-31 17:22:56,727 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-01-31 17:22:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:58,893 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-31 17:22:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 17:22:58,894 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-01-31 17:22:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:58,895 INFO L225 Difference]: With dead ends: 70 [2019-01-31 17:22:58,895 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:22:58,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-31 17:22:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:22:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-31 17:22:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 17:22:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-31 17:22:58,900 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-01-31 17:22:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:58,900 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-31 17:22:58,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-31 17:22:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-31 17:22:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-31 17:22:58,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:58,901 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-01-31 17:22:58,901 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-01-31 17:22:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:58,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:58,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:00,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:00,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:00,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:00,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:00,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:00,209 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-31 17:23:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:00,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:00,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-31 17:23:00,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:00,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:00,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:00,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:00,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:00,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:23:01,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:23:01,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:01,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:01,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:23:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:01,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:04,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:04,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-01-31 17:23:04,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:04,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 17:23:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 17:23:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:23:04,903 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-01-31 17:23:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:07,638 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-31 17:23:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 17:23:07,638 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-01-31 17:23:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:07,639 INFO L225 Difference]: With dead ends: 72 [2019-01-31 17:23:07,639 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:23:07,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:23:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:23:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-01-31 17:23:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-31 17:23:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-31 17:23:07,644 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-01-31 17:23:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:07,644 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-31 17:23:07,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 17:23:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-31 17:23:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-31 17:23:07,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:07,645 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-01-31 17:23:07,646 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-01-31 17:23:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:07,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:07,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:07,858 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:23:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:09,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:09,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:09,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:09,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:09,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:09,292 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-31 17:23:09,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:09,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:09,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:09,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:09,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:09,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:09,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:09,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:09,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:23:11,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:23:11,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:11,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:11,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:23:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:11,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:14,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:14,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-01-31 17:23:14,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:14,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-31 17:23:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-31 17:23:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-31 17:23:14,216 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-01-31 17:23:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:16,531 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-31 17:23:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 17:23:16,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-01-31 17:23:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:16,532 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:23:16,532 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 17:23:16,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-31 17:23:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 17:23:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-31 17:23:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 17:23:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-31 17:23:16,537 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-01-31 17:23:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:16,538 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-31 17:23:16,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-31 17:23:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-31 17:23:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-31 17:23:16,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:16,539 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-01-31 17:23:16,539 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-01-31 17:23:16,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:16,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:16,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:16,797 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:23:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:18,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:18,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:18,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:18,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:18,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:18,284 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-31 17:23:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:18,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:18,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:18,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:18,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:18,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:18,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:23:20,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:23:20,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:20,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:20,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:23:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:20,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:23,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:23,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-01-31 17:23:23,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:23,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-31 17:23:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-31 17:23:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 17:23:23,414 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-01-31 17:23:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:25,900 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-31 17:23:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 17:23:25,905 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-01-31 17:23:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:25,906 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:23:25,906 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:23:25,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 17:23:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:23:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-01-31 17:23:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:23:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-31 17:23:25,910 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-01-31 17:23:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:25,911 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-31 17:23:25,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-31 17:23:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-31 17:23:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-31 17:23:25,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:25,912 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-01-31 17:23:25,912 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-01-31 17:23:25,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:25,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:27,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:27,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:27,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:27,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:27,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:27,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 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-31 17:23:27,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:27,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:27,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-31 17:23:27,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:27,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:27,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:27,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:27,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:27,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:23:29,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:23:29,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:29,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:29,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:23:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:29,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:33,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:33,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-01-31 17:23:33,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:33,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 17:23:33,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 17:23:33,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-31 17:23:33,155 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-01-31 17:23:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:36,300 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-31 17:23:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 17:23:36,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-01-31 17:23:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:36,301 INFO L225 Difference]: With dead ends: 78 [2019-01-31 17:23:36,301 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:23:36,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-31 17:23:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:23:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-31 17:23:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 17:23:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-31 17:23:36,306 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-01-31 17:23:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:36,306 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-31 17:23:36,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 17:23:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-31 17:23:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-31 17:23:36,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:36,307 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-01-31 17:23:36,307 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-01-31 17:23:36,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:36,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:36,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:37,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:37,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:37,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:37,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:37,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:37,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:23:37,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:37,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:37,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:37,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:37,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:37,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:37,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:37,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:37,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:23:40,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:23:40,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:40,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:40,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:23:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:40,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:43,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:43,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-01-31 17:23:43,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:43,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-31 17:23:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-31 17:23:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:23:43,841 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-01-31 17:23:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:46,845 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-31 17:23:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 17:23:46,845 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-01-31 17:23:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:46,846 INFO L225 Difference]: With dead ends: 80 [2019-01-31 17:23:46,846 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 17:23:46,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:23:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 17:23:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-31 17:23:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:23:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-31 17:23:46,851 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-01-31 17:23:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:46,851 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-31 17:23:46,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-31 17:23:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-31 17:23:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-31 17:23:46,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:46,852 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-01-31 17:23:46,852 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-01-31 17:23:46,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:46,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:46,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:46,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:47,119 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:23:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:48,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:48,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:48,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:48,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:48,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:48,615 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-31 17:23:48,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:48,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:48,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:48,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:48,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:48,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:48,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:23:50,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:23:50,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:50,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:50,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:23:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:51,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:54,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:54,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-01-31 17:23:54,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:54,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-31 17:23:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-31 17:23:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-31 17:23:54,854 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-01-31 17:23:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:57,597 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-31 17:23:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 17:23:57,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-01-31 17:23:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:57,599 INFO L225 Difference]: With dead ends: 82 [2019-01-31 17:23:57,599 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 17:23:57,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-31 17:23:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 17:23:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-31 17:23:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 17:23:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-31 17:23:57,604 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-01-31 17:23:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:57,604 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-31 17:23:57,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-31 17:23:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-31 17:23:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-31 17:23:57,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:57,605 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-01-31 17:23:57,605 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-01-31 17:23:57,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:57,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:57,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:59,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:59,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:59,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:59,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:59,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:59,463 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-31 17:23:59,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:59,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:59,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-31 17:23:59,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:59,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:59,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:23:59,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:59,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:59,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:24:01,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:24:01,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:01,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:01,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:24:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:01,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:05,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:05,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-01-31 17:24:05,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:05,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 17:24:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 17:24:05,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 17:24:05,827 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-01-31 17:24:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:09,380 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-31 17:24:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 17:24:09,380 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-01-31 17:24:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:09,381 INFO L225 Difference]: With dead ends: 84 [2019-01-31 17:24:09,381 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:24:09,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 17:24:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:24:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-01-31 17:24:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-31 17:24:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-31 17:24:09,387 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-01-31 17:24:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:09,387 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-31 17:24:09,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 17:24:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-31 17:24:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-31 17:24:09,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:09,388 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-01-31 17:24:09,388 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-01-31 17:24:09,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:09,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:09,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:09,663 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:24:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:11,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:11,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:11,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:11,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:11,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:11,320 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-31 17:24:11,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:11,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:11,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:11,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:11,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:11,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:24:11,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:11,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:11,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:24:13,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:24:13,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:13,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:13,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:24:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:13,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:18,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:18,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-01-31 17:24:18,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-31 17:24:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-31 17:24:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-31 17:24:18,062 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-01-31 17:24:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:21,089 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-31 17:24:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 17:24:21,089 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-01-31 17:24:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:21,090 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:24:21,090 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:24:21,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-31 17:24:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:24:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-01-31 17:24:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:24:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-31 17:24:21,096 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-01-31 17:24:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:21,096 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-31 17:24:21,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-31 17:24:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-31 17:24:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-31 17:24:21,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:21,097 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-01-31 17:24:21,097 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-01-31 17:24:21,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:21,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:21,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:21,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:21,375 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:24:21,645 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:24:21,942 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:24:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:23,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:23,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:23,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:23,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:23,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:23,746 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-31 17:24:23,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:23,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:23,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:23,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:24:23,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:23,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:23,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:24:26,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:24:26,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:26,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:26,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:24:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:26,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:31,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:31,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-01-31 17:24:31,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:31,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-31 17:24:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-31 17:24:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:24:31,011 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-01-31 17:24:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:35,042 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-31 17:24:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 17:24:35,042 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-01-31 17:24:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:35,044 INFO L225 Difference]: With dead ends: 88 [2019-01-31 17:24:35,044 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:24:35,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:24:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:24:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-01-31 17:24:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-31 17:24:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-31 17:24:35,049 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-01-31 17:24:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:35,050 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-31 17:24:35,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-31 17:24:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-31 17:24:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-31 17:24:35,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:35,050 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-01-31 17:24:35,050 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-01-31 17:24:35,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:35,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:35,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:35,282 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:24:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:36,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:36,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:36,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:36,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:36,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:36,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 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-31 17:24:36,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:36,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:37,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-31 17:24:37,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:37,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:37,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:24:37,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:37,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:37,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:24:39,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:24:39,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:39,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:39,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:24:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:39,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:44,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:44,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-01-31 17:24:44,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:44,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:24:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:24:44,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-31 17:24:44,320 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-01-31 17:24:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:49,039 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-31 17:24:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 17:24:49,039 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-01-31 17:24:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:49,040 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:24:49,040 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:24:49,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-31 17:24:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:24:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-31 17:24:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-31 17:24:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-31 17:24:49,046 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-01-31 17:24:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:49,046 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-31 17:24:49,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:24:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-31 17:24:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-31 17:24:49,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:49,047 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-01-31 17:24:49,047 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-01-31 17:24:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:49,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:49,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:51,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:51,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:51,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:51,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:51,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:51,027 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-31 17:24:51,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:51,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:51,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:51,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:51,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:51,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:24:51,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:51,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:51,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:24:53,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:24:53,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:24:53,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:24:53,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:24:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:53,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:58,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:58,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-01-31 17:24:58,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:58,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-31 17:24:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-31 17:24:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:24:58,630 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-01-31 17:25:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:03,336 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-31 17:25:03,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 17:25:03,336 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-01-31 17:25:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:03,337 INFO L225 Difference]: With dead ends: 92 [2019-01-31 17:25:03,337 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:25:03,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:25:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:25:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-31 17:25:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-31 17:25:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-31 17:25:03,343 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-01-31 17:25:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:03,344 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-31 17:25:03,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-31 17:25:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-31 17:25:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-31 17:25:03,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:03,344 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-01-31 17:25:03,344 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-01-31 17:25:03,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:03,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:03,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:03,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:03,607 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:25:03,770 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:25:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:05,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:05,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:05,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:05,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:05,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:05,677 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-31 17:25:05,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:05,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:05,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:05,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:25:05,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:05,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:05,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:25:08,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:25:08,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:08,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:08,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:25:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:08,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:13,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-01-31 17:25:13,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:13,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-31 17:25:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-31 17:25:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-31 17:25:13,635 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-01-31 17:25:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:17,526 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-31 17:25:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 17:25:17,526 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-01-31 17:25:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:17,527 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:25:17,528 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:25:17,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-31 17:25:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:25:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-01-31 17:25:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-31 17:25:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-31 17:25:17,533 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-01-31 17:25:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:17,533 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-31 17:25:17,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-31 17:25:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-31 17:25:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-31 17:25:17,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:17,534 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-01-31 17:25:17,534 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-01-31 17:25:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:17,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:17,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:17,748 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:25:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:19,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:19,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:19,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:19,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:19,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:19,711 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-31 17:25:19,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:19,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:19,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-31 17:25:19,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:19,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:19,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:25:19,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:19,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:19,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:25:23,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:25:23,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:23,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:23,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:25:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:23,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:28,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:28,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-01-31 17:25:28,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:28,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:25:28,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:25:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:25:28,603 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-01-31 17:25:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:32,900 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-31 17:25:32,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 17:25:32,901 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-01-31 17:25:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:32,902 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:25:32,902 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:25:32,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:25:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:25:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-01-31 17:25:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-31 17:25:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-31 17:25:32,908 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-01-31 17:25:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:32,908 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-31 17:25:32,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:25:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-31 17:25:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-31 17:25:32,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:32,909 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-01-31 17:25:32,909 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-01-31 17:25:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:32,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:32,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:35,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:35,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:35,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:35,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:35,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:35,004 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-31 17:25:35,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:35,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:35,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:35,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:35,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:35,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:25:35,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:35,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:35,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:25:38,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:25:38,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:38,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:38,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:25:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:38,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:43,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:43,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-01-31 17:25:43,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:43,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-31 17:25:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-31 17:25:43,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-31 17:25:43,887 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-01-31 17:25:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:48,546 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-31 17:25:48,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 17:25:48,546 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-01-31 17:25:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:48,547 INFO L225 Difference]: With dead ends: 98 [2019-01-31 17:25:48,548 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:25:48,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-31 17:25:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:25:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-01-31 17:25:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:25:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-31 17:25:48,552 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-01-31 17:25:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:48,553 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-31 17:25:48,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-31 17:25:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-31 17:25:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-31 17:25:48,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:48,553 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-01-31 17:25:48,553 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-01-31 17:25:48,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:48,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:48,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:48,750 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:25:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:50,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:50,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:50,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:50,758 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-31 17:25:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:50,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:50,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:50,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:25:50,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:50,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:50,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:25:54,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:25:54,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:25:54,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:25:54,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:25:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:54,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:59,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-01-31 17:25:59,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:59,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-31 17:25:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-31 17:25:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:25:59,959 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-01-31 17:26:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:04,290 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-31 17:26:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 17:26:04,291 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-01-31 17:26:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:04,292 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:26:04,292 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:26:04,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:26:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:26:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-31 17:26:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:26:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-31 17:26:04,297 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-01-31 17:26:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:04,297 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-31 17:26:04,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-31 17:26:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-31 17:26:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-31 17:26:04,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:04,298 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-01-31 17:26:04,298 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-01-31 17:26:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:04,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:06,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:06,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:06,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:06,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:06,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:06,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 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-31 17:26:06,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:26:06,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:26:06,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-31 17:26:06,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:06,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:06,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:26:06,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:06,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:06,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:26:10,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:26:10,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:10,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:10,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:26:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:10,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:16,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-01-31 17:26:16,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:26:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:26:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-31 17:26:16,416 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-01-31 17:26:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:20,748 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-31 17:26:20,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 17:26:20,748 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-01-31 17:26:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:20,749 INFO L225 Difference]: With dead ends: 102 [2019-01-31 17:26:20,750 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:26:20,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-31 17:26:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:26:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-31 17:26:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:26:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-31 17:26:20,756 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-01-31 17:26:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:20,757 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-31 17:26:20,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:26:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-31 17:26:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-31 17:26:20,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:20,758 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-01-31 17:26:20,758 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-01-31 17:26:20,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:20,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:20,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:23,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:23,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:23,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:23,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:23,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:23,272 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-31 17:26:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:26:23,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:26:23,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:26:23,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:23,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:23,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:26:23,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:23,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:23,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:26:26,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:26:26,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:26,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:26,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:26:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:26,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:33,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:33,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-01-31 17:26:33,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:33,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-31 17:26:33,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-31 17:26:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:26:33,200 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-01-31 17:26:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:37,603 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-31 17:26:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 17:26:37,603 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-01-31 17:26:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:37,604 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:26:37,604 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:26:37,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:26:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:26:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-31 17:26:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:26:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-31 17:26:37,611 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-01-31 17:26:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:37,612 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-31 17:26:37,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-31 17:26:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-31 17:26:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-31 17:26:37,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:37,613 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-01-31 17:26:37,613 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-01-31 17:26:37,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:37,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:37,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:40,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:40,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:40,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:40,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:40,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:40,213 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-31 17:26:40,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:40,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:26:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:40,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:40,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:26:40,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:40,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:40,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:26:44,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:26:44,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:44,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:44,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:26:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:44,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:50,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:50,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-01-31 17:26:50,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:50,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-31 17:26:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-31 17:26:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-31 17:26:50,781 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-01-31 17:26:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:55,621 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-31 17:26:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 17:26:55,621 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-01-31 17:26:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:55,623 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:26:55,623 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:26:55,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-31 17:26:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:26:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-31 17:26:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:26:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-31 17:26:55,630 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-01-31 17:26:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:55,630 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-31 17:26:55,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-31 17:26:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-31 17:26:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-31 17:26:55,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:55,631 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-01-31 17:26:55,631 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-01-31 17:26:55,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:55,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:55,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:55,923 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:26:56,172 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:26:56,444 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:26:56,740 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:26:57,064 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:26:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:59,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:59,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:59,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:59,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:59,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:59,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 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-31 17:26:59,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:26:59,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:26:59,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-31 17:26:59,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:59,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:59,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:26:59,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:26:59,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:26:59,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:27:03,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:27:03,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:27:03,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:27:03,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:27:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:03,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:10,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:10,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-01-31 17:27:10,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:10,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:27:10,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:27:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:27:10,398 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-01-31 17:27:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:16,090 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-31 17:27:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 17:27:16,091 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-01-31 17:27:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:16,092 INFO L225 Difference]: With dead ends: 108 [2019-01-31 17:27:16,093 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:27:16,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:27:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:27:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-31 17:27:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 17:27:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-31 17:27:16,099 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-01-31 17:27:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:16,100 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-31 17:27:16,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:27:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-31 17:27:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-31 17:27:16,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:16,101 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-01-31 17:27:16,101 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-01-31 17:27:16,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:16,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:16,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:16,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:16,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:16,385 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:19,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:19,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:19,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:19,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:19,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:19,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:27:19,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:27:19,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:27:19,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:27:19,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:19,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:19,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:27:19,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:27:19,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:27:19,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:27:22,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:27:22,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:27:22,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:27:22,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:27:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:22,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:30,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:30,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-01-31 17:27:30,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:30,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-31 17:27:30,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-31 17:27:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-31 17:27:30,242 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-01-31 17:27:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:37,372 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-31 17:27:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 17:27:37,372 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-01-31 17:27:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:37,373 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:27:37,374 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:27:37,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-31 17:27:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:27:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-31 17:27:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:27:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-31 17:27:37,381 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-01-31 17:27:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:37,381 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-31 17:27:37,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-31 17:27:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-31 17:27:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-31 17:27:37,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:37,382 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-01-31 17:27:37,382 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-01-31 17:27:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:37,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:37,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:37,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:37,586 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:40,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:40,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:40,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:40,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:40,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:40,382 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-31 17:27:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:40,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:27:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:40,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:40,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:27:40,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:27:40,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:27:40,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:27:44,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:27:44,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:27:44,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:27:44,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:27:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:44,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:52,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:52,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-01-31 17:27:52,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:52,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-31 17:27:52,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-31 17:27:52,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:27:52,283 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-01-31 17:27:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:57,208 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-31 17:27:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 17:27:57,208 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-01-31 17:27:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:57,209 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:27:57,209 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:27:57,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:27:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:27:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-01-31 17:27:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-31 17:27:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-31 17:27:57,215 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-01-31 17:27:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:57,216 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-31 17:27:57,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-31 17:27:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-31 17:27:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-31 17:27:57,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:57,216 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-01-31 17:27:57,216 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-01-31 17:27:57,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:57,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:57,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:57,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:57,511 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:57,772 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:27:58,046 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:58,359 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:58,689 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:59,048 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:27:59,381 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:28:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:02,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:02,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:02,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:02,142 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-31 17:28:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:28:02,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:28:02,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-31 17:28:02,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:02,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:02,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:28:02,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:28:02,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:28:02,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:28:06,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:28:06,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:28:06,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:28:06,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:28:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:06,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:13,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:13,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-01-31 17:28:13,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:13,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 17:28:13,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 17:28:13,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-31 17:28:13,944 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-01-31 17:28:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:20,682 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-31 17:28:20,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 17:28:20,682 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-01-31 17:28:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:20,684 INFO L225 Difference]: With dead ends: 114 [2019-01-31 17:28:20,684 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:28:20,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-31 17:28:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:28:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-01-31 17:28:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 17:28:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-31 17:28:20,690 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-01-31 17:28:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:20,690 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-31 17:28:20,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 17:28:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-31 17:28:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 17:28:20,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:20,691 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-01-31 17:28:20,691 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-01-31 17:28:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:20,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:20,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:23,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:23,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:23,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:23,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:23,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:23,416 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-31 17:28:23,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:28:23,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:28:23,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:28:23,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:23,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:23,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:28:23,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:28:23,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:28:23,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:28:27,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:28:27,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:28:27,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:28:27,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:28:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:28,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:35,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:35,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-01-31 17:28:35,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:35,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-01-31 17:28:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-01-31 17:28:35,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:28:35,988 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-01-31 17:28:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:41,480 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-31 17:28:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 17:28:41,480 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-01-31 17:28:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:41,482 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:28:41,482 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:28:41,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:28:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:28:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-01-31 17:28:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-31 17:28:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-31 17:28:41,489 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-01-31 17:28:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:41,489 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-31 17:28:41,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-01-31 17:28:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-31 17:28:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-31 17:28:41,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:41,490 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-01-31 17:28:41,490 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-01-31 17:28:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:41,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:41,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:41,782 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:28:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:44,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:44,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:44,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:44,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:44,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:44,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 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-31 17:28:44,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:44,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:28:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:44,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:44,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:28:44,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:28:44,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:28:44,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:28:49,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:28:49,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:28:49,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:28:49,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:28:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:49,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:57,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:57,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-01-31 17:28:57,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:57,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-01-31 17:28:57,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-01-31 17:28:57,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-31 17:28:57,376 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-01-31 17:29:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:04,955 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-31 17:29:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 17:29:04,956 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-01-31 17:29:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:04,957 INFO L225 Difference]: With dead ends: 118 [2019-01-31 17:29:04,957 INFO L226 Difference]: Without dead ends: 117 [2019-01-31 17:29:04,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-31 17:29:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-31 17:29:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-01-31 17:29:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-31 17:29:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-31 17:29:04,962 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-01-31 17:29:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:04,963 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-31 17:29:04,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-01-31 17:29:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-31 17:29:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-31 17:29:04,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:04,964 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-01-31 17:29:04,964 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-01-31 17:29:04,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:04,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:04,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:04,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:04,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:08,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:08,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:08,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:08,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:08,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:08,045 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-31 17:29:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:29:08,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:29:08,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-31 17:29:08,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:08,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:08,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:29:08,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:29:08,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:29:08,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:29:12,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:29:12,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:29:12,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:29:12,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:29:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:12,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:21,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-01-31 17:29:21,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:21,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-31 17:29:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-31 17:29:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:29:21,038 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-01-31 17:29:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:27,395 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-31 17:29:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 17:29:27,395 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-01-31 17:29:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:27,396 INFO L225 Difference]: With dead ends: 120 [2019-01-31 17:29:27,397 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:29:27,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:29:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:29:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-31 17:29:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-31 17:29:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-01-31 17:29:27,402 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-01-31 17:29:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:27,403 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-01-31 17:29:27,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-31 17:29:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-01-31 17:29:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-31 17:29:27,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:27,403 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-01-31 17:29:27,404 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-01-31 17:29:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:27,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:27,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:30,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:30,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:30,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:30,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:30,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:30,425 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-31 17:29:30,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:29:30,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:29:30,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:29:30,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:30,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:30,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:29:30,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:29:30,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:29:30,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:29:35,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:29:35,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:29:35,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:29:35,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:29:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:35,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-01-31 17:29:44,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-01-31 17:29:44,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-01-31 17:29:44,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-31 17:29:44,094 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-01-31 17:29:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:49,650 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-01-31 17:29:49,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 17:29:49,651 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-01-31 17:29:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:49,652 INFO L225 Difference]: With dead ends: 122 [2019-01-31 17:29:49,652 INFO L226 Difference]: Without dead ends: 121 [2019-01-31 17:29:49,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-31 17:29:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-31 17:29:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-01-31 17:29:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-31 17:29:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-01-31 17:29:49,657 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-01-31 17:29:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:49,657 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-01-31 17:29:49,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-01-31 17:29:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-01-31 17:29:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-31 17:29:49,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:49,658 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-01-31 17:29:49,658 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-01-31 17:29:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:49,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:49,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:52,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:52,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:52,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:52,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:52,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:52,945 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-31 17:29:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:29:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:52,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:52,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:29:52,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:29:53,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:29:53,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:29:58,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:29:58,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:29:58,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:29:58,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:29:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:58,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:06,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:06,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-01-31 17:30:06,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:06,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-01-31 17:30:06,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-01-31 17:30:06,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:30:06,832 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-01-31 17:30:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:14,445 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-01-31 17:30:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 17:30:14,453 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-01-31 17:30:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:14,454 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:30:14,454 INFO L226 Difference]: Without dead ends: 123 [2019-01-31 17:30:14,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:30:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-31 17:30:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-01-31 17:30:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-31 17:30:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-31 17:30:14,460 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-01-31 17:30:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:14,460 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-31 17:30:14,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-01-31 17:30:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-31 17:30:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-31 17:30:14,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:14,461 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-01-31 17:30:14,461 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-01-31 17:30:14,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:14,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:14,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:30:14,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:14,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:17,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:17,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:17,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:17,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:17,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:17,552 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-31 17:30:17,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:30:17,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:30:17,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-31 17:30:17,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:17,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:17,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:30:17,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:30:17,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:30:17,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:30:22,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:30:22,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:30:22,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:30:22,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:30:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:22,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:32,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:32,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-01-31 17:30:32,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:32,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-31 17:30:32,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-31 17:30:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-31 17:30:32,095 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-01-31 17:30:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:41,293 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-31 17:30:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 17:30:41,294 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-01-31 17:30:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:41,295 INFO L225 Difference]: With dead ends: 126 [2019-01-31 17:30:41,295 INFO L226 Difference]: Without dead ends: 125 [2019-01-31 17:30:41,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-31 17:30:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-31 17:30:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-01-31 17:30:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-31 17:30:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-01-31 17:30:41,302 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-01-31 17:30:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:41,302 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-01-31 17:30:41,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-31 17:30:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-01-31 17:30:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-31 17:30:41,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:41,302 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-01-31 17:30:41,303 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-01-31 17:30:41,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:41,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:41,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:30:41,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:41,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:41,602 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:30:41,863 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:30:42,148 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:30:42,459 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:30:42,770 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:30:43,119 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:30:43,491 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:30:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:46,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:46,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:46,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:46,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:46,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:46,638 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-31 17:30:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:30:46,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:30:46,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:30:46,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:46,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:46,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:30:46,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:30:46,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:30:46,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:30:51,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:30:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:30:51,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:30:51,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:30:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:52,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:01,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:01,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-01-31 17:31:01,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:01,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-01-31 17:31:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-01-31 17:31:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:31:01,536 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-01-31 17:31:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:10,997 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-01-31 17:31:10,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 17:31:10,997 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-01-31 17:31:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:10,998 INFO L225 Difference]: With dead ends: 128 [2019-01-31 17:31:10,998 INFO L226 Difference]: Without dead ends: 127 [2019-01-31 17:31:11,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:31:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-31 17:31:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-31 17:31:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-31 17:31:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-31 17:31:11,004 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-01-31 17:31:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:11,004 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-31 17:31:11,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-01-31 17:31:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-31 17:31:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-31 17:31:11,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:11,005 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-01-31 17:31:11,005 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-01-31 17:31:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:11,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:11,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:11,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:11,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:11,289 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:31:11,560 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:31:11,853 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:31:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:15,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:15,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:15,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:15,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:15,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:15,307 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-31 17:31:15,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:15,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:31:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:15,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:15,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:31:15,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:31:15,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:31:15,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:31:20,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:31:20,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:31:20,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:31:20,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:31:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:20,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:30,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:30,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-01-31 17:31:30,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:30,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-01-31 17:31:30,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-01-31 17:31:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-31 17:31:30,590 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-01-31 17:31:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:38,745 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-31 17:31:38,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 17:31:38,745 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-01-31 17:31:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:38,746 INFO L225 Difference]: With dead ends: 130 [2019-01-31 17:31:38,747 INFO L226 Difference]: Without dead ends: 129 [2019-01-31 17:31:38,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-31 17:31:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-31 17:31:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-01-31 17:31:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-31 17:31:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-01-31 17:31:38,752 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-01-31 17:31:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:38,752 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-01-31 17:31:38,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-01-31 17:31:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-01-31 17:31:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-31 17:31:38,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:38,753 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-01-31 17:31:38,753 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:38,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:38,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-01-31 17:31:38,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:38,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:38,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:39,006 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:31:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:42,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:42,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:42,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:42,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 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-31 17:31:42,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:31:42,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:31:42,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-31 17:31:42,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:31:42,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:42,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:31:42,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:31:42,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:31:42,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:31:48,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:31:48,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:31:48,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:31:48,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:31:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:48,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:58,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-01-31 17:31:58,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:58,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-31 17:31:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-31 17:31:58,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:31:58,214 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-01-31 17:32:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:04,712 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-01-31 17:32:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 17:32:04,713 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-01-31 17:32:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:04,714 INFO L225 Difference]: With dead ends: 132 [2019-01-31 17:32:04,714 INFO L226 Difference]: Without dead ends: 131 [2019-01-31 17:32:04,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:32:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-31 17:32:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-01-31 17:32:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-31 17:32:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-01-31 17:32:04,720 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-01-31 17:32:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:04,720 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-01-31 17:32:04,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-31 17:32:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-01-31 17:32:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-31 17:32:04,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:04,721 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-01-31 17:32:04,721 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:04,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-01-31 17:32:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:04,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:04,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:05,007 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:32:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:08,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:08,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:08,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:08,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:08,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:08,590 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-31 17:32:08,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:32:08,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:32:08,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:32:08,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:32:08,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:08,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:32:08,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:32:08,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:32:08,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:32:14,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:32:14,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:32:14,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:32:14,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:32:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:14,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:24,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:24,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-01-31 17:32:24,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:24,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-01-31 17:32:24,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-01-31 17:32:24,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-31 17:32:24,986 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-01-31 17:32:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:33,310 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-01-31 17:32:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 17:32:33,311 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-01-31 17:32:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:33,312 INFO L225 Difference]: With dead ends: 134 [2019-01-31 17:32:33,312 INFO L226 Difference]: Without dead ends: 133 [2019-01-31 17:32:33,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-31 17:32:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-31 17:32:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-01-31 17:32:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 17:32:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-31 17:32:33,320 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-01-31 17:32:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:33,320 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-31 17:32:33,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-01-31 17:32:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-31 17:32:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-31 17:32:33,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:33,321 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-01-31 17:32:33,321 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-01-31 17:32:33,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:33,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:33,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:36,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:36,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:36,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:36,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:36,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:36,995 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-31 17:32:37,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:32:37,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:32:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:37,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:37,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:32:37,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:32:37,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:32:37,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:32:43,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:32:43,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:32:43,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:32:43,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:32:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:43,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:54,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:54,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-01-31 17:32:54,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:54,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-01-31 17:32:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-01-31 17:32:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:32:54,016 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-01-31 17:33:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:04,633 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-31 17:33:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 17:33:04,633 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-01-31 17:33:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:04,634 INFO L225 Difference]: With dead ends: 136 [2019-01-31 17:33:04,635 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 17:33:04,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:33:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 17:33:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-01-31 17:33:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-31 17:33:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-01-31 17:33:04,642 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-01-31 17:33:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:04,643 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-01-31 17:33:04,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-01-31 17:33:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-01-31 17:33:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-31 17:33:04,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:04,644 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-01-31 17:33:04,644 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-01-31 17:33:04,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:33:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:04,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:08,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:08,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:08,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:08,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:08,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:08,504 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-31 17:33:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:33:08,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:33:08,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-31 17:33:08,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:08,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:08,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:33:08,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:33:08,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:33:08,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:33:15,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:33:15,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:33:15,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:33:15,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:33:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:15,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:26,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:26,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-01-31 17:33:26,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:26,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-31 17:33:26,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-31 17:33:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-31 17:33:26,369 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-01-31 17:33:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:33,790 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-01-31 17:33:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 17:33:33,790 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-01-31 17:33:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:33,792 INFO L225 Difference]: With dead ends: 138 [2019-01-31 17:33:33,792 INFO L226 Difference]: Without dead ends: 137 [2019-01-31 17:33:33,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-31 17:33:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-31 17:33:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-31 17:33:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-31 17:33:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-31 17:33:33,799 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-01-31 17:33:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:33,800 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-31 17:33:33,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-31 17:33:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-31 17:33:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-31 17:33:33,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:33,801 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-01-31 17:33:33,801 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-01-31 17:33:33,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:33,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:33,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:33:33,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:33,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:34,010 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:33:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:37,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:37,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:37,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:37,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:37,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:37,643 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-31 17:33:37,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:33:37,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:33:37,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:33:37,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:37,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:37,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:33:37,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:33:37,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:33:37,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-31 17:33:44,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-31 17:33:44,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:33:44,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:33:44,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-31 17:33:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:44,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:55,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:55,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-01-31 17:33:55,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:55,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-31 17:33:55,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-31 17:33:55,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:33:55,591 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states.