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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:53:59,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:53:59,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:53:59,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:53:59,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:53:59,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:53:59,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:53:59,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:53:59,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:53:59,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:53:59,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:53:59,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:53:59,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:53:59,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:53:59,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:53:59,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:53:59,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:53:59,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:53:59,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:53:59,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:53:59,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:53:59,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:53:59,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:53:59,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:53:59,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:53:59,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:53:59,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:53:59,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:53:59,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:53:59,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:53:59,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:53:59,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:53:59,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:53:59,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:53:59,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:53:59,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:53:59,286 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-18 17:53:59,308 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:53:59,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:53:59,309 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:53:59,309 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:53:59,310 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:53:59,310 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:53:59,311 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:53:59,311 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:53:59,311 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:53:59,311 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 17:53:59,311 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 17:53:59,312 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:53:59,312 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:53:59,313 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:53:59,314 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:53:59,314 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:53:59,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:53:59,314 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:53:59,315 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:53:59,315 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:53:59,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:53:59,315 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:53:59,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:53:59,315 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:53:59,316 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:53:59,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:53:59,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:53:59,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:53:59,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:53:59,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:53:59,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:53:59,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:53:59,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:53:59,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:53:59,319 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:53:59,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:53:59,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:53:59,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:53:59,320 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:53:59,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:53:59,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:53:59,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:53:59,379 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:53:59,379 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:53:59,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-18 17:53:59,380 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-18 17:53:59,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:53:59,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:53:59,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:53:59,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:53:59,421 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:53:59,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:53:59,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:53:59,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:53:59,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:53:59,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... [2019-01-18 17:53:59,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:53:59,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:53:59,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:53:59,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:53:59,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:53:59,552 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-18 17:53:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:53:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:53:59,854 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:53:59,855 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-18 17:53:59,856 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:53:59 BoogieIcfgContainer [2019-01-18 17:53:59,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:53:59,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:53:59,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:53:59,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:53:59,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:53:59" (1/2) ... [2019-01-18 17:53:59,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff7745f and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:53:59, skipping insertion in model container [2019-01-18 17:53:59,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:53:59" (2/2) ... [2019-01-18 17:53:59,864 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-18 17:53:59,874 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:53:59,882 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:53:59,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:53:59,926 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:53:59,926 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:53:59,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:53:59,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:53:59,927 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:53:59,927 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:53:59,927 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:53:59,927 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:53:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-18 17:53:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:53:59,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:59,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:53:59,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-18 17:53:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:00,199 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-18 17:54:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:54:00,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:54:00,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:54:00,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:54:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:54:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:54:00,226 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-18 17:54:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:00,413 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-18 17:54:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:54:00,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-18 17:54:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:00,426 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:54:00,426 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:54:00,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:54:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:54:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-18 17:54:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:54:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-18 17:54:00,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-18 17:54:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:00,460 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-18 17:54:00,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:54:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-18 17:54:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:54:00,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:00,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:54:00,461 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-18 17:54:00,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:00,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:00,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:00,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:54:00,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-18 17:54:00,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:54:00,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:54:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:54:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:54:00,579 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-18 17:54:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:00,685 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-18 17:54:00,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:54:00,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-18 17:54:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:00,687 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:54:00,687 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:54:00,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:54:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:54:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-18 17:54:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:54:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-18 17:54:00,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-18 17:54:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:00,695 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-18 17:54:00,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:54:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-18 17:54:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:54:00,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:00,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:54:00,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-18 17:54:00,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:00,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:00,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:54:00,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:54:00,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:54:00,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:54:00,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:54:00,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:54:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:54:00,756 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-18 17:54:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:00,832 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-18 17:54:00,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:54:00,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-18 17:54:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:00,836 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:54:00,836 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:54:00,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:54:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:54:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-18 17:54:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:54:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-18 17:54:00,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-18 17:54:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:00,841 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-18 17:54:00,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:54:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-18 17:54:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:54:00,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:00,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:54:00,842 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-18 17:54:00,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:00,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:01,135 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-18 17:54:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:01,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:01,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:01,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:54:01,183 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-18 17:54:01,230 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:54:01,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:54:01,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:54:01,524 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:54:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:01,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:54:01,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:01,532 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-18 17:54:01,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:01,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:01,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:01,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:01,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:01,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-18 17:54:01,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:01,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:54:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:54:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:54:01,774 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-18 17:54:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:02,016 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-18 17:54:02,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:54:02,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-18 17:54:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:02,019 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:54:02,019 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:54:02,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:54:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:54:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-18 17:54:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:54:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-18 17:54:02,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-18 17:54:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:02,024 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-18 17:54:02,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:54:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-18 17:54:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-18 17:54:02,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:02,025 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:54:02,026 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-18 17:54:02,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:02,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:02,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:02,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:02,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:02,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-18 17:54:02,095 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-18 17:54:02,097 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:54:02,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:54:02,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:54:02,216 INFO L272 AbstractInterpreter]: Visited 12 different actions 97 times. Merged at 11 different actions 71 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 17:54:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:02,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:54:02,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:02,217 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-18 17:54:02,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:02,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:02,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:02,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:02,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:02,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-18 17:54:02,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:02,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:54:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:54:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:54:02,422 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-18 17:54:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:02,794 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-18 17:54:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:54:02,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-18 17:54:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:02,796 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:54:02,796 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:54:02,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:54:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:54:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-18 17:54:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:54:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-18 17:54:02,801 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-18 17:54:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:02,801 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-18 17:54:02,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:54:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-18 17:54:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:54:02,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:02,802 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:54:02,802 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-18 17:54:02,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:02,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:02,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:03,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:03,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:03,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:03,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:03,129 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-18 17:54:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:03,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:03,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:54:03,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:03,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:03,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-18 17:54:03,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:03,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:54:03,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:54:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:54:03,304 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-18 17:54:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:03,595 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-18 17:54:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:54:03,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-18 17:54:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:03,597 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:54:03,597 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 17:54:03,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:54:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 17:54:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-18 17:54:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:54:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-18 17:54:03,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-18 17:54:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:03,603 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-18 17:54:03,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:54:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-18 17:54:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:54:03,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:03,604 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-18 17:54:03,605 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:03,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-18 17:54:03,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:03,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:03,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:03,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:03,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:03,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:03,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:03,782 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-18 17:54:03,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:03,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:03,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:03,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:03,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:03,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-18 17:54:03,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:03,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:54:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:54:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:54:03,920 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-18 17:54:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:04,059 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-18 17:54:04,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:54:04,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-18 17:54:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:04,060 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:54:04,060 INFO L226 Difference]: Without dead ends: 26 [2019-01-18 17:54:04,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:54:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-18 17:54:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-18 17:54:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:54:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-18 17:54:04,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-18 17:54:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-18 17:54:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:54:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-18 17:54:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:54:04,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:04,069 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-18 17:54:04,069 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-18 17:54:04,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:04,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:04,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:04,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:04,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:04,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:04,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:04,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:04,353 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-18 17:54:04,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:04,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:04,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:04,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:04,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:04,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-18 17:54:04,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:04,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:54:04,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:54:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:54:04,533 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-18 17:54:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:04,913 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-18 17:54:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:54:04,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-18 17:54:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:04,915 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:54:04,915 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:54:04,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:54:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:54:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-18 17:54:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:54:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-18 17:54:04,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-18 17:54:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:04,923 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-18 17:54:04,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:54:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-18 17:54:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:54:04,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:04,924 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-18 17:54:04,925 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-18 17:54:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:04,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:04,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:05,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:05,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:05,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:05,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:05,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:05,012 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-18 17:54:05,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:05,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:05,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:54:05,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:05,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:05,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:05,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:05,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-18 17:54:05,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:05,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:54:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:54:05,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:54:05,200 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-18 17:54:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:05,806 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-18 17:54:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:54:05,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-18 17:54:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:05,808 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:54:05,808 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:54:05,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:54:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:54:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-18 17:54:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:54:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-18 17:54:05,817 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-18 17:54:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:05,817 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-18 17:54:05,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:54:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-18 17:54:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:54:05,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:05,818 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-18 17:54:05,818 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-18 17:54:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:05,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:05,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:06,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:06,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:06,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:06,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:06,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:06,047 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-18 17:54:06,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:06,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:06,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:06,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:06,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:06,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:06,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-18 17:54:06,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:06,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:54:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:54:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:54:06,247 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-18 17:54:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:06,668 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-18 17:54:06,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:54:06,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-18 17:54:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:06,677 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:54:06,677 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 17:54:06,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:54:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 17:54:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-18 17:54:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:54:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-18 17:54:06,685 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-18 17:54:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:06,685 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-18 17:54:06,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:54:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-18 17:54:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:54:06,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:06,687 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-18 17:54:06,687 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:06,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-18 17:54:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:06,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:06,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:06,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:06,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:07,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:07,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:07,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:07,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:07,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:07,095 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-18 17:54:07,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:07,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:07,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:07,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:07,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:07,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-18 17:54:07,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:07,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:54:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:54:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:54:07,417 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-18 17:54:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:07,701 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-18 17:54:07,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:54:07,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-18 17:54:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:07,702 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:54:07,703 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:54:07,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:54:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:54:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-18 17:54:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:54:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-18 17:54:07,710 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-18 17:54:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:07,710 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-18 17:54:07,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:54:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-18 17:54:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-18 17:54:07,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:07,711 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-18 17:54:07,712 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:07,712 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-18 17:54:07,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:07,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:07,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:07,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:07,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:07,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:07,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:07,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:07,987 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-18 17:54:07,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:07,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:08,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-18 17:54:08,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:08,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:08,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:09,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:09,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-18 17:54:09,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:09,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:54:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:54:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:54:09,041 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-18 17:54:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:11,078 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-18 17:54:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:54:11,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-18 17:54:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:11,080 INFO L225 Difference]: With dead ends: 97 [2019-01-18 17:54:11,081 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:54:11,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:54:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:54:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-18 17:54:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:54:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-18 17:54:11,091 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-18 17:54:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:11,092 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-18 17:54:11,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:54:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-18 17:54:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:54:11,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:11,093 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-18 17:54:11,094 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-18 17:54:11,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:11,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:11,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:11,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:11,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:11,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:11,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:11,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:11,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:11,602 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-18 17:54:11,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:11,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:11,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:11,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:11,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:11,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-18 17:54:11,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:11,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:54:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:54:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:54:11,955 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-18 17:54:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:13,670 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-18 17:54:13,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:54:13,670 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-18 17:54:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:13,672 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:54:13,672 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 17:54:13,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-18 17:54:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 17:54:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-18 17:54:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:54:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-18 17:54:13,682 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-18 17:54:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:13,683 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-18 17:54:13,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:54:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-18 17:54:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:54:13,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:13,684 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-18 17:54:13,685 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-18 17:54:13,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:13,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:13,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:13,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:13,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:13,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:13,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:13,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:13,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:13,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:13,850 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-18 17:54:13,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:13,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:13,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:14,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-18 17:54:14,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:14,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:54:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:54:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:54:14,195 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-18 17:54:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:14,497 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-18 17:54:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:54:14,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-18 17:54:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:14,500 INFO L225 Difference]: With dead ends: 105 [2019-01-18 17:54:14,500 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:54:14,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:54:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:54:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-18 17:54:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:54:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-18 17:54:14,509 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-18 17:54:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:14,509 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-18 17:54:14,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:54:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-18 17:54:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:54:14,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:14,511 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-18 17:54:14,511 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-18 17:54:14,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:14,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:14,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:14,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:14,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:14,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:14,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:14,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:14,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:14,876 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-18 17:54:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:14,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:14,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:54:14,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:14,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:15,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:15,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:15,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-18 17:54:15,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:15,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:54:15,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:54:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:54:15,255 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-18 17:54:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:16,522 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-18 17:54:16,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:54:16,523 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-18 17:54:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:16,524 INFO L225 Difference]: With dead ends: 109 [2019-01-18 17:54:16,524 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:54:16,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:54:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:54:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-18 17:54:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:54:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-18 17:54:16,535 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-18 17:54:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:16,535 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-18 17:54:16,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:54:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-18 17:54:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:54:16,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:16,536 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-18 17:54:16,537 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-18 17:54:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:16,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:16,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:16,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:16,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:16,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:16,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:16,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:16,778 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-18 17:54:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:16,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:16,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:16,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:16,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:16,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:17,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:17,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-18 17:54:17,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:17,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:54:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:54:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:54:17,146 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-18 17:54:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:17,645 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-18 17:54:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:54:17,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-18 17:54:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:17,646 INFO L225 Difference]: With dead ends: 120 [2019-01-18 17:54:17,646 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:54:17,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:54:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:54:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-18 17:54:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:54:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-18 17:54:17,660 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-18 17:54:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:17,660 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-18 17:54:17,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:54:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-18 17:54:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:54:17,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:17,662 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-18 17:54:17,662 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-18 17:54:17,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:17,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:17,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:17,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:18,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:18,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:18,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:18,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:18,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:18,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:54:18,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:18,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:18,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:18,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-18 17:54:18,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:18,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:54:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:54:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-18 17:54:18,467 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-18 17:54:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:19,917 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-18 17:54:19,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:54:19,917 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-18 17:54:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:19,918 INFO L225 Difference]: With dead ends: 124 [2019-01-18 17:54:19,919 INFO L226 Difference]: Without dead ends: 94 [2019-01-18 17:54:19,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-18 17:54:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-18 17:54:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-18 17:54:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:54:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-18 17:54:19,931 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-18 17:54:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:19,931 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-18 17:54:19,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:54:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-18 17:54:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:54:19,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:19,933 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-18 17:54:19,933 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-18 17:54:19,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:19,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:20,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:20,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:20,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:20,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:20,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:20,125 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-18 17:54:20,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:20,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:20,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-18 17:54:20,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:20,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:20,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:20,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:20,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-18 17:54:20,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:20,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:54:20,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:54:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-18 17:54:20,575 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-18 17:54:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:21,012 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-18 17:54:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:54:21,013 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-18 17:54:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:21,013 INFO L225 Difference]: With dead ends: 135 [2019-01-18 17:54:21,013 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:54:21,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:54:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:54:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-18 17:54:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:54:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-18 17:54:21,027 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-18 17:54:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:21,027 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-18 17:54:21,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:54:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-18 17:54:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:54:21,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:21,028 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-18 17:54:21,029 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-18 17:54:21,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:21,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:21,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:21,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:21,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:21,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:21,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:21,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:21,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:21,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:21,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 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-18 17:54:21,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:21,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:21,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:21,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:21,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:21,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:21,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:21,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-18 17:54:21,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:21,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:54:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:54:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:54:21,904 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-18 17:54:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:23,888 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-18 17:54:23,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:54:23,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-18 17:54:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:23,889 INFO L225 Difference]: With dead ends: 139 [2019-01-18 17:54:23,889 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:54:23,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:54:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:54:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-18 17:54:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-18 17:54:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-18 17:54:23,901 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-18 17:54:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:23,901 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-18 17:54:23,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:54:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-18 17:54:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-18 17:54:23,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:23,902 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-18 17:54:23,902 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-18 17:54:23,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:23,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:23,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:24,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:24,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:24,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:24,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:24,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:24,367 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-18 17:54:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:24,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:24,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:24,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:24,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:24,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-18 17:54:24,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:24,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:54:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:54:24,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:54:24,966 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-18 17:54:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:25,342 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-18 17:54:25,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:54:25,343 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-18 17:54:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:25,343 INFO L225 Difference]: With dead ends: 150 [2019-01-18 17:54:25,344 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:54:25,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:54:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:54:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-18 17:54:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:54:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-18 17:54:25,353 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-18 17:54:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-18 17:54:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:54:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-18 17:54:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:54:25,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:25,354 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-18 17:54:25,354 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-18 17:54:25,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:25,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:25,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:25,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:25,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:25,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:25,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:25,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:25,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:25,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:25,850 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-18 17:54:25,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:25,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:25,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:54:25,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:25,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:26,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:27,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:27,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-18 17:54:27,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:27,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:54:27,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:54:27,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-18 17:54:27,880 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-18 17:54:30,366 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-18 17:54:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:32,339 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-18 17:54:32,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:54:32,339 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-18 17:54:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:32,340 INFO L225 Difference]: With dead ends: 192 [2019-01-18 17:54:32,340 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:54:32,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-18 17:54:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:54:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-18 17:54:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:54:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-18 17:54:32,357 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-18 17:54:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:32,357 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-18 17:54:32,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:54:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-18 17:54:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:54:32,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:32,358 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-18 17:54:32,358 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-18 17:54:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:32,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:32,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:33,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:33,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:33,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:33,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:33,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:33,450 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-18 17:54:33,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:33,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:33,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:33,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:33,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:34,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:34,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:34,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-18 17:54:34,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:34,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:54:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:54:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:54:34,084 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-18 17:54:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:36,219 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-18 17:54:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:54:36,221 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-18 17:54:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:36,222 INFO L225 Difference]: With dead ends: 169 [2019-01-18 17:54:36,222 INFO L226 Difference]: Without dead ends: 127 [2019-01-18 17:54:36,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:54:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-18 17:54:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-18 17:54:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:54:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-18 17:54:36,233 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-18 17:54:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:36,234 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-18 17:54:36,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:54:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-18 17:54:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:54:36,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:36,234 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-18 17:54:36,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-18 17:54:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:36,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:36,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:36,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:36,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:36,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:36,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:36,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:36,591 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-18 17:54:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:36,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:36,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:36,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:37,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:37,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-18 17:54:37,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:37,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:54:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:54:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:54:37,095 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-18 17:54:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:37,602 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-18 17:54:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:54:37,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-18 17:54:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:37,603 INFO L225 Difference]: With dead ends: 180 [2019-01-18 17:54:37,603 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:54:37,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:54:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:54:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-18 17:54:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:54:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-18 17:54:37,614 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-18 17:54:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:37,614 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-18 17:54:37,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:54:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-18 17:54:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:54:37,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:37,615 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-18 17:54:37,616 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-18 17:54:37,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:37,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:37,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:38,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:38,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:38,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:38,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:38,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:38,295 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-18 17:54:38,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:38,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:38,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:54:38,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:38,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:39,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:40,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:40,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-18 17:54:40,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:40,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:54:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:54:40,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-18 17:54:40,435 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-18 17:54:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:46,672 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-18 17:54:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:54:46,673 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-18 17:54:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:46,674 INFO L225 Difference]: With dead ends: 230 [2019-01-18 17:54:46,675 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 17:54:46,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-18 17:54:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 17:54:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-18 17:54:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-18 17:54:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-18 17:54:46,692 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-18 17:54:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:46,692 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-18 17:54:46,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:54:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-18 17:54:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-18 17:54:46,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:46,693 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-18 17:54:46,693 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-18 17:54:46,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:46,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:46,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:47,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:47,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:47,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:47,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:47,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:47,279 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-18 17:54:47,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:47,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:47,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:47,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:47,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:47,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:48,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:48,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-18 17:54:48,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:48,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:54:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:54:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:54:48,094 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-18 17:54:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:51,266 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-18 17:54:51,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:54:51,266 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-18 17:54:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:51,268 INFO L225 Difference]: With dead ends: 199 [2019-01-18 17:54:51,268 INFO L226 Difference]: Without dead ends: 149 [2019-01-18 17:54:51,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:54:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-18 17:54:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-18 17:54:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 17:54:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-18 17:54:51,282 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-18 17:54:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:51,283 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-18 17:54:51,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:54:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-18 17:54:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-18 17:54:51,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:51,284 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-18 17:54:51,284 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-18 17:54:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:51,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:51,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:51,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:51,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:51,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:51,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:51,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:51,628 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-18 17:54:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:51,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:51,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:52,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:53,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:53,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-18 17:54:53,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:53,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:54:53,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:54:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:54:53,364 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-18 17:54:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:54,005 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-18 17:54:54,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:54:54,005 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-18 17:54:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:54,006 INFO L225 Difference]: With dead ends: 210 [2019-01-18 17:54:54,007 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:54:54,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:54:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:54:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-18 17:54:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:54:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-18 17:54:54,023 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-18 17:54:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:54,023 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-18 17:54:54,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:54:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-18 17:54:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 17:54:54,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:54,024 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-18 17:54:54,024 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-18 17:54:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:54,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:55,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:55,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:55,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:55,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:55,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:55,035 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-18 17:54:55,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:55,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:55,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-18 17:54:55,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:55,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:55,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:55,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:55,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-18 17:54:55,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:55,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:54:55,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:54:55,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-18 17:54:55,874 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-18 17:54:58,265 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-18 17:54:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:59,430 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-18 17:54:59,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:54:59,431 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-18 17:54:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:59,432 INFO L225 Difference]: With dead ends: 214 [2019-01-18 17:54:59,432 INFO L226 Difference]: Without dead ends: 160 [2019-01-18 17:54:59,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-18 17:54:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-18 17:54:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-18 17:54:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 17:54:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-18 17:54:59,452 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-18 17:54:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:59,452 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-18 17:54:59,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:54:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-18 17:54:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 17:54:59,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:59,453 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-18 17:54:59,453 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:59,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-18 17:54:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:59,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:59,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:59,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:59,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:59,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:59,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:59,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:59,873 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-18 17:54:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:59,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:59,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:59,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:59,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:00,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:00,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-18 17:55:00,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:00,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:55:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:55:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-18 17:55:00,649 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-18 17:55:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:01,234 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-18 17:55:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:55:01,235 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-18 17:55:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:01,236 INFO L225 Difference]: With dead ends: 225 [2019-01-18 17:55:01,236 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 17:55:01,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:55:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 17:55:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-18 17:55:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 17:55:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-18 17:55:01,250 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-18 17:55:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:01,250 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-18 17:55:01,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:55:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-18 17:55:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 17:55:01,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:01,251 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-18 17:55:01,251 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-18 17:55:01,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:01,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:01,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:02,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:02,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:02,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:02,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:02,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:02,159 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-18 17:55:02,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:02,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:02,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:02,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-18 17:55:02,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:02,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:55:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:55:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:55:02,924 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-18 17:55:07,641 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-18 17:55:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:07,951 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-18 17:55:07,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:55:07,951 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-18 17:55:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:07,952 INFO L225 Difference]: With dead ends: 229 [2019-01-18 17:55:07,952 INFO L226 Difference]: Without dead ends: 171 [2019-01-18 17:55:07,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:55:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-18 17:55:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-18 17:55:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 17:55:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-18 17:55:07,975 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-18 17:55:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:07,975 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-18 17:55:07,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:55:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-18 17:55:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 17:55:07,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:07,976 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-18 17:55:07,976 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-18 17:55:07,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:07,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:07,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:07,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:08,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:08,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:08,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:08,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:08,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:08,801 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-18 17:55:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:08,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:08,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:55:08,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:08,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:09,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:09,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:09,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-18 17:55:09,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:09,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:55:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:55:09,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:55:09,640 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-18 17:55:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:10,153 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-18 17:55:10,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:55:10,153 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-18 17:55:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:10,154 INFO L225 Difference]: With dead ends: 240 [2019-01-18 17:55:10,154 INFO L226 Difference]: Without dead ends: 117 [2019-01-18 17:55:10,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:55:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-18 17:55:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-18 17:55:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-18 17:55:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-18 17:55:10,177 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-18 17:55:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:10,177 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-18 17:55:10,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:55:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-18 17:55:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-18 17:55:10,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:10,178 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-18 17:55:10,178 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-18 17:55:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:10,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:10,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:11,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:11,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:11,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:11,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:11,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:11,012 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-18 17:55:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:11,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:11,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:11,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:11,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:11,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:12,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:12,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-18 17:55:12,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:12,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:55:12,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:55:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-18 17:55:12,008 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-18 17:55:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:17,107 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-18 17:55:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:55:17,115 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-18 17:55:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:17,116 INFO L225 Difference]: With dead ends: 244 [2019-01-18 17:55:17,116 INFO L226 Difference]: Without dead ends: 182 [2019-01-18 17:55:17,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-18 17:55:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-18 17:55:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-18 17:55:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-18 17:55:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-18 17:55:17,139 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-18 17:55:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:17,140 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-18 17:55:17,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:55:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-18 17:55:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-18 17:55:17,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:17,141 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-18 17:55:17,141 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-18 17:55:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:17,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:17,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:17,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:17,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:17,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:17,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:17,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:17,611 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-18 17:55:17,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:17,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:17,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:18,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:18,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-18 17:55:18,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:18,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:55:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:55:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-18 17:55:18,549 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-18 17:55:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:19,581 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-18 17:55:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:55:19,582 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-18 17:55:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:19,583 INFO L225 Difference]: With dead ends: 255 [2019-01-18 17:55:19,583 INFO L226 Difference]: Without dead ends: 124 [2019-01-18 17:55:19,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:55:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-18 17:55:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-18 17:55:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-18 17:55:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-18 17:55:19,605 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-18 17:55:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:19,605 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-18 17:55:19,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:55:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-18 17:55:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-18 17:55:19,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:19,606 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-18 17:55:19,606 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-18 17:55:19,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:19,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:19,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:20,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:20,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:20,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:20,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:20,525 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-18 17:55:20,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:20,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:20,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-18 17:55:20,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:20,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:22,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:24,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:24,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-18 17:55:24,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:24,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:55:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:55:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:55:24,577 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-18 17:55:32,815 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-18 17:55:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:34,809 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-18 17:55:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-18 17:55:34,809 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-18 17:55:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:34,810 INFO L225 Difference]: With dead ends: 325 [2019-01-18 17:55:34,810 INFO L226 Difference]: Without dead ends: 190 [2019-01-18 17:55:34,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 17:55:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-18 17:55:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-18 17:55:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-18 17:55:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-18 17:55:34,834 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-18 17:55:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:34,835 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-18 17:55:34,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:55:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-18 17:55:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-18 17:55:34,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:34,836 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-18 17:55:34,836 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-18 17:55:34,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:34,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:34,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:36,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:36,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:36,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:36,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:36,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:36,267 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-18 17:55:36,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:36,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:36,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:36,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:36,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:37,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:37,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:37,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-18 17:55:37,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:37,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:55:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:55:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-18 17:55:37,354 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-18 17:55:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:42,826 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-18 17:55:42,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:55:42,826 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-18 17:55:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:42,828 INFO L225 Difference]: With dead ends: 274 [2019-01-18 17:55:42,828 INFO L226 Difference]: Without dead ends: 204 [2019-01-18 17:55:42,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-18 17:55:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-18 17:55:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-18 17:55:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-18 17:55:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-18 17:55:42,853 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-18 17:55:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:42,853 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-18 17:55:42,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:55:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-18 17:55:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-18 17:55:42,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:42,854 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-18 17:55:42,855 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-18 17:55:42,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:42,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:42,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:42,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:44,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:44,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:44,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:44,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:44,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:44,145 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-18 17:55:44,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:44,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:44,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:44,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:45,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:45,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-18 17:55:45,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:45,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:55:45,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:55:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-18 17:55:45,415 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-18 17:55:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:46,315 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-18 17:55:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:55:46,316 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-18 17:55:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:46,317 INFO L225 Difference]: With dead ends: 285 [2019-01-18 17:55:46,317 INFO L226 Difference]: Without dead ends: 138 [2019-01-18 17:55:46,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:55:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-18 17:55:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-18 17:55:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-18 17:55:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-18 17:55:46,342 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-18 17:55:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:46,342 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-18 17:55:46,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:55:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-18 17:55:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-18 17:55:46,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:46,343 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-18 17:55:46,344 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-18 17:55:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:46,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:46,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:47,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:47,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:47,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:47,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:47,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:47,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 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-18 17:55:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:47,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:47,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:55:47,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:47,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:50,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:52,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:52,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-18 17:55:52,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:52,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:55:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:55:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:55:52,253 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-18 17:56:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:05,894 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-18 17:56:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-18 17:56:05,895 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-18 17:56:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:05,896 INFO L225 Difference]: With dead ends: 363 [2019-01-18 17:56:05,897 INFO L226 Difference]: Without dead ends: 212 [2019-01-18 17:56:05,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 17:56:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-18 17:56:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-18 17:56:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-18 17:56:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-18 17:56:05,920 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-18 17:56:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:05,920 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-18 17:56:05,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:56:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-18 17:56:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-18 17:56:05,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:05,921 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-18 17:56:05,921 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-18 17:56:05,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:05,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:05,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:07,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:07,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:07,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:07,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:07,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:07,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 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-18 17:56:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:07,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:07,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:07,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:07,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:08,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:08,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:08,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-18 17:56:08,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:08,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:56:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:56:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-18 17:56:08,445 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-18 17:56:12,684 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-18 17:56:12,951 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-18 17:56:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:15,112 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-18 17:56:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:56:15,112 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-18 17:56:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:15,113 INFO L225 Difference]: With dead ends: 304 [2019-01-18 17:56:15,113 INFO L226 Difference]: Without dead ends: 226 [2019-01-18 17:56:15,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-18 17:56:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-18 17:56:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-18 17:56:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-18 17:56:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-18 17:56:15,137 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-18 17:56:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:15,137 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-18 17:56:15,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:56:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-18 17:56:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-18 17:56:15,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:15,138 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-18 17:56:15,139 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-18 17:56:15,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:15,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:15,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:15,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:15,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:15,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:15,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:15,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:15,884 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-18 17:56:15,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:15,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:15,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:16,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:17,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:17,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-18 17:56:17,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:17,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:56:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:56:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-18 17:56:17,306 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-18 17:56:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:18,665 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-18 17:56:18,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:56:18,667 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-18 17:56:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:18,668 INFO L225 Difference]: With dead ends: 315 [2019-01-18 17:56:18,669 INFO L226 Difference]: Without dead ends: 152 [2019-01-18 17:56:18,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:56:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-18 17:56:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-18 17:56:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-18 17:56:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-18 17:56:18,720 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-18 17:56:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:18,720 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-18 17:56:18,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:56:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-18 17:56:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-18 17:56:18,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:18,722 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-18 17:56:18,722 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-18 17:56:18,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:18,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:20,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:20,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:20,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:20,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:20,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:20,610 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-18 17:56:20,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:20,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:20,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:56:20,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:20,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:23,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:26,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:26,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-18 17:56:26,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:26,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:56:26,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:56:26,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:56:26,583 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-18 17:56:38,377 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-18 17:56:38,683 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-18 17:56:38,980 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-18 17:56:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:41,896 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-18 17:56:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-18 17:56:41,896 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-18 17:56:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:41,898 INFO L225 Difference]: With dead ends: 401 [2019-01-18 17:56:41,898 INFO L226 Difference]: Without dead ends: 234 [2019-01-18 17:56:41,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-18 17:56:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-18 17:56:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-18 17:56:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-18 17:56:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-18 17:56:41,933 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-18 17:56:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:41,933 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-18 17:56:41,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:56:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-18 17:56:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-18 17:56:41,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:41,935 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-18 17:56:41,935 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-18 17:56:41,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:41,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:41,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:43,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:43,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:43,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:43,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:43,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:43,760 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-18 17:56:43,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:43,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:43,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:43,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:43,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:45,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:46,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:46,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-18 17:56:46,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:46,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:56:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:56:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-18 17:56:46,090 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-18 17:56:51,919 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-18 17:56:52,229 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-18 17:56:52,527 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-18 17:56:52,724 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:56:52,912 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:56:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:54,807 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-18 17:56:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 17:56:54,807 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-18 17:56:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:54,809 INFO L225 Difference]: With dead ends: 334 [2019-01-18 17:56:54,809 INFO L226 Difference]: Without dead ends: 248 [2019-01-18 17:56:54,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-18 17:56:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-18 17:56:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-18 17:56:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-18 17:56:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-18 17:56:54,841 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-18 17:56:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:54,841 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-18 17:56:54,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:56:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-18 17:56:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-18 17:56:54,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:54,842 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-18 17:56:54,842 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:54,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-18 17:56:54,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:54,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:54,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:54,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:54,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:56,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:56,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:56,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:56,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:56,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:56,372 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-18 17:56:56,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:56,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:56,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:57,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:57,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:57,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-18 17:56:57,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:57,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:56:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:56:57,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-18 17:56:57,946 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-18 17:56:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:59,536 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-18 17:56:59,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:56:59,538 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-18 17:56:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:59,539 INFO L225 Difference]: With dead ends: 345 [2019-01-18 17:56:59,539 INFO L226 Difference]: Without dead ends: 166 [2019-01-18 17:56:59,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:56:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-18 17:56:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-18 17:56:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-18 17:56:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-18 17:56:59,566 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-18 17:56:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:59,566 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-18 17:56:59,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:56:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-18 17:56:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-18 17:56:59,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:59,567 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-18 17:56:59,567 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-18 17:56:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:01,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:01,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:01,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:01,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:01,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:01,316 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-18 17:57:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:01,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:01,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-18 17:57:01,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:01,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:02,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:02,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:02,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-18 17:57:02,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:02,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:57:02,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:57:02,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:57:02,903 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-18 17:57:09,779 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-18 17:57:10,114 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-18 17:57:10,415 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-18 17:57:10,619 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:57:10,817 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:57:11,008 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:57:11,197 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-18 17:57:11,450 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-18 17:57:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:13,188 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-18 17:57:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 17:57:13,189 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-18 17:57:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:13,190 INFO L225 Difference]: With dead ends: 349 [2019-01-18 17:57:13,190 INFO L226 Difference]: Without dead ends: 259 [2019-01-18 17:57:13,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:57:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-18 17:57:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-18 17:57:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-18 17:57:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-18 17:57:13,220 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-18 17:57:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:13,220 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-18 17:57:13,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:57:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-18 17:57:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-18 17:57:13,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:13,221 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-18 17:57:13,221 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-18 17:57:13,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:13,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:13,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:14,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:14,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:14,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:14,133 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-18 17:57:14,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:14,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:14,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:14,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:14,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:15,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:15,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:15,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-18 17:57:15,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:15,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:57:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:57:15,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:57:15,859 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-18 17:57:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:17,858 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-18 17:57:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:57:17,859 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-18 17:57:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:17,860 INFO L225 Difference]: With dead ends: 360 [2019-01-18 17:57:17,860 INFO L226 Difference]: Without dead ends: 173 [2019-01-18 17:57:17,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:57:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-18 17:57:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-18 17:57:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-18 17:57:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-18 17:57:17,890 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-18 17:57:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:17,890 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-18 17:57:17,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:57:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-18 17:57:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-18 17:57:17,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:17,891 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-18 17:57:17,891 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:17,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-18 17:57:17,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:17,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:17,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:19,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:19,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:19,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:19,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:19,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:19,436 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-18 17:57:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:19,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:19,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:21,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:21,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:21,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-18 17:57:21,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:21,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:57:21,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:57:21,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-18 17:57:21,383 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-18 17:57:28,885 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-18 17:57:29,234 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-18 17:57:29,578 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-18 17:57:29,824 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 17:57:30,040 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:57:30,248 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:57:30,460 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:57:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:32,675 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-18 17:57:32,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 17:57:32,675 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-18 17:57:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:32,677 INFO L225 Difference]: With dead ends: 364 [2019-01-18 17:57:32,677 INFO L226 Difference]: Without dead ends: 270 [2019-01-18 17:57:32,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-18 17:57:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-18 17:57:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-18 17:57:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-18 17:57:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-18 17:57:32,727 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-18 17:57:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:32,728 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-18 17:57:32,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:57:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-18 17:57:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-18 17:57:32,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:32,729 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-18 17:57:32,729 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-18 17:57:32,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:32,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:32,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:33,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:33,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:33,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:33,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:33,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:33,907 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-18 17:57:33,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:33,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:34,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:57:34,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:34,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:35,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:36,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:36,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-18 17:57:36,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:36,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:57:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:57:36,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-18 17:57:36,065 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-18 17:57:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:38,104 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-18 17:57:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:57:38,105 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-18 17:57:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:38,106 INFO L225 Difference]: With dead ends: 375 [2019-01-18 17:57:38,106 INFO L226 Difference]: Without dead ends: 180 [2019-01-18 17:57:38,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:57:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-18 17:57:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-18 17:57:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-18 17:57:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-18 17:57:38,138 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-18 17:57:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:38,138 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-18 17:57:38,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:57:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-18 17:57:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-18 17:57:38,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:38,139 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-18 17:57:38,139 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-18 17:57:38,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:38,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:38,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:39,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:39,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:39,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:39,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:39,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:39,958 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-18 17:57:39,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:39,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:39,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:39,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:39,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:41,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:41,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:41,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-18 17:57:41,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:41,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:57:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:57:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:57:41,784 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-18 17:57:48,312 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-18 17:57:48,674 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-18 17:57:49,027 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-18 17:57:49,269 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 17:57:49,502 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 17:57:49,734 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:57:49,948 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:57:50,153 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:57:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:52,460 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-18 17:57:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 17:57:52,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-18 17:57:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:52,462 INFO L225 Difference]: With dead ends: 379 [2019-01-18 17:57:52,462 INFO L226 Difference]: Without dead ends: 281 [2019-01-18 17:57:52,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:57:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-18 17:57:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-18 17:57:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-18 17:57:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-18 17:57:52,495 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-18 17:57:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:52,495 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-18 17:57:52,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:57:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-18 17:57:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-18 17:57:52,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:52,496 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-18 17:57:52,497 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-18 17:57:52,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:52,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:52,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:52,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:52,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:53,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:53,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:53,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:53,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:53,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:53,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 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-18 17:57:53,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:53,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:53,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:55,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:55,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:55,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-18 17:57:55,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:55,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:57:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:57:55,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:57:55,912 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-18 17:57:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:58,060 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-18 17:57:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:57:58,060 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-18 17:57:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:58,062 INFO L225 Difference]: With dead ends: 390 [2019-01-18 17:57:58,062 INFO L226 Difference]: Without dead ends: 187 [2019-01-18 17:57:58,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:57:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-18 17:57:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-18 17:57:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-18 17:57:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-18 17:57:58,110 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-18 17:57:58,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:58,110 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-18 17:57:58,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:57:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-18 17:57:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-18 17:57:58,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:58,111 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-18 17:57:58,111 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-18 17:57:58,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:58,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:58,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:59,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:59,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:59,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:59,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:59,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:59,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:57:59,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:59,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:59,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-18 17:57:59,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:59,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:04,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:08,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:08,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-18 17:58:08,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:08,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-18 17:58:08,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-18 17:58:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-18 17:58:08,549 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-18 17:58:26,197 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-18 17:58:26,651 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-18 17:58:27,100 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-18 17:58:27,469 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 17:58:27,830 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 17:58:28,239 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 17:58:28,596 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:58:28,902 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:58:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:32,271 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-18 17:58:32,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-18 17:58:32,272 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-18 17:58:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:32,274 INFO L225 Difference]: With dead ends: 496 [2019-01-18 17:58:32,274 INFO L226 Difference]: Without dead ends: 289 [2019-01-18 17:58:32,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-18 17:58:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-18 17:58:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-18 17:58:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-18 17:58:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-18 17:58:32,313 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-18 17:58:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-18 17:58:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-18 17:58:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-18 17:58:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-18 17:58:32,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:32,314 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-18 17:58:32,315 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-18 17:58:32,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:32,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:32,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:32,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:34,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:34,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:34,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:34,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:34,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:34,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:58:34,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:34,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:34,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:34,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:34,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:36,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:36,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:36,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-18 17:58:36,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:36,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:58:36,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:58:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:58:36,739 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-18 17:58:45,263 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-18 17:58:45,654 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-18 17:58:46,031 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-18 17:58:46,310 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 17:58:46,563 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 17:58:46,809 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 17:58:47,050 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 17:58:47,279 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:58:47,498 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:58:47,709 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:58:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:50,179 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-18 17:58:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-18 17:58:50,180 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-18 17:58:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:50,181 INFO L225 Difference]: With dead ends: 409 [2019-01-18 17:58:50,181 INFO L226 Difference]: Without dead ends: 303 [2019-01-18 17:58:50,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:58:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-18 17:58:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-18 17:58:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-18 17:58:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-18 17:58:50,222 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-18 17:58:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:50,222 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-18 17:58:50,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:58:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-18 17:58:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-18 17:58:50,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:50,223 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-18 17:58:50,224 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-18 17:58:50,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:50,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:50,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:51,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:51,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:51,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:51,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:51,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:51,309 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-18 17:58:51,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:51,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:51,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:54,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:55,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-18 17:58:55,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:55,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:58:55,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:58:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:58:55,955 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-18 17:58:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:58,335 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-18 17:58:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:58:58,336 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-18 17:58:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:58,337 INFO L225 Difference]: With dead ends: 420 [2019-01-18 17:58:58,337 INFO L226 Difference]: Without dead ends: 201 [2019-01-18 17:58:58,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:58:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-18 17:58:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-18 17:58:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-18 17:58:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-18 17:58:58,379 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-18 17:58:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:58,379 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-18 17:58:58,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:58:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-18 17:58:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-18 17:58:58,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:58,380 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-18 17:58:58,380 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:58,381 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-18 17:58:58,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:58,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:00,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:00,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:00,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:00,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:00,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:00,532 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-18 17:59:00,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:00,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:00,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-18 17:59:00,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:00,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:02,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:02,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:02,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-18 17:59:02,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:02,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:59:02,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:59:02,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-18 17:59:02,727 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-18 17:59:11,253 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-18 17:59:11,690 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-18 17:59:12,097 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-18 17:59:12,391 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 17:59:12,673 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 17:59:12,945 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 17:59:13,205 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 17:59:13,459 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 17:59:13,701 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:59:13,935 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:59:14,197 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:59:14,456 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-18 17:59:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:16,639 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-18 17:59:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-18 17:59:16,639 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-18 17:59:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:16,641 INFO L225 Difference]: With dead ends: 424 [2019-01-18 17:59:16,641 INFO L226 Difference]: Without dead ends: 314 [2019-01-18 17:59:16,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-18 17:59:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-18 17:59:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-18 17:59:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-18 17:59:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-18 17:59:16,709 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-18 17:59:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:16,710 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-18 17:59:16,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:59:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-18 17:59:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-18 17:59:16,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:16,711 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-18 17:59:16,711 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:16,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-18 17:59:16,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:16,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:16,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:16,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:16,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:17,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:17,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:17,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:17,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:17,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:17,820 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-18 17:59:17,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:17,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:17,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:17,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:17,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:19,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:20,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:20,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-18 17:59:20,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:20,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:59:20,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:59:20,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-18 17:59:20,496 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-18 17:59:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:22,874 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-18 17:59:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:59:22,874 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-18 17:59:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:22,875 INFO L225 Difference]: With dead ends: 435 [2019-01-18 17:59:22,875 INFO L226 Difference]: Without dead ends: 208 [2019-01-18 17:59:22,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:59:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-18 17:59:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-18 17:59:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-18 17:59:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-18 17:59:22,926 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-18 17:59:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:22,926 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-18 17:59:22,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:59:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-18 17:59:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-18 17:59:22,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:22,927 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-18 17:59:22,927 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-18 17:59:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:22,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:22,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:22,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:22,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:25,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:25,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:25,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:25,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:25,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:25,317 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-18 17:59:25,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:25,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:25,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:27,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:27,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:27,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-18 17:59:27,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:27,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:59:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:59:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:59:27,729 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-18 17:59:36,927 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-18 17:59:37,359 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-18 17:59:37,788 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-18 17:59:38,091 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 17:59:38,381 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 17:59:38,664 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 17:59:38,936 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 17:59:39,197 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 17:59:39,466 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 17:59:39,732 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 17:59:40,009 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 17:59:40,238 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 17:59:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:42,652 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-18 17:59:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-18 17:59:42,653 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-18 17:59:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:42,655 INFO L225 Difference]: With dead ends: 439 [2019-01-18 17:59:42,655 INFO L226 Difference]: Without dead ends: 325 [2019-01-18 17:59:42,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:59:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-18 17:59:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-18 17:59:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-18 17:59:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-18 17:59:42,726 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-18 17:59:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:42,726 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-18 17:59:42,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:59:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-18 17:59:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-18 17:59:42,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:42,728 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-18 17:59:42,728 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-18 17:59:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:42,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:42,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:44,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:44,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:44,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:44,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:44,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:44,567 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-18 17:59:44,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:44,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:44,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-18 17:59:44,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:44,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:46,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:47,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:47,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-18 17:59:47,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:47,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:59:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:59:47,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:59:47,563 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-18 17:59:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:50,447 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-18 17:59:50,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:59:50,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-18 17:59:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:50,449 INFO L225 Difference]: With dead ends: 450 [2019-01-18 17:59:50,449 INFO L226 Difference]: Without dead ends: 215 [2019-01-18 17:59:50,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:59:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-18 17:59:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-18 17:59:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-18 17:59:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-18 17:59:50,521 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-18 17:59:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:50,522 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-18 17:59:50,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:59:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-18 17:59:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-18 17:59:50,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:50,523 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-18 17:59:50,523 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-18 17:59:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:50,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:50,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:52,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:52,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:52,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:52,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:52,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:52,672 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-18 17:59:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:52,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:52,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:52,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:52,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:55,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:55,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-18 17:59:55,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:55,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 17:59:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 17:59:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-18 17:59:55,721 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-18 18:00:05,940 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-18 18:00:06,383 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-18 18:00:06,825 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-18 18:00:07,133 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:00:07,429 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:00:07,727 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:00:08,009 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:00:08,283 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:00:08,566 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:00:08,821 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:00:09,063 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:00:09,297 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:00:09,534 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:00:10,614 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-18 18:00:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:12,175 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-18 18:00:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-18 18:00:12,176 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-18 18:00:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:12,178 INFO L225 Difference]: With dead ends: 454 [2019-01-18 18:00:12,179 INFO L226 Difference]: Without dead ends: 336 [2019-01-18 18:00:12,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-18 18:00:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-18 18:00:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-18 18:00:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-18 18:00:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-18 18:00:12,242 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-18 18:00:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:12,243 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-18 18:00:12,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 18:00:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-18 18:00:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-18 18:00:12,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:12,244 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-18 18:00:12,244 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-18 18:00:12,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:12,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:12,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:12,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:12,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:13,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:13,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:13,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:13,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:13,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:13,507 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-18 18:00:13,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:13,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:13,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:15,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:16,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:16,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-18 18:00:16,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 18:00:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 18:00:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-18 18:00:16,416 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-18 18:00:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:19,196 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-18 18:00:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 18:00:19,197 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-18 18:00:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:19,198 INFO L225 Difference]: With dead ends: 465 [2019-01-18 18:00:19,198 INFO L226 Difference]: Without dead ends: 222 [2019-01-18 18:00:19,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 18:00:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-18 18:00:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-18 18:00:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-18 18:00:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-18 18:00:19,245 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-18 18:00:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:19,245 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-18 18:00:19,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 18:00:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-18 18:00:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-18 18:00:19,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:19,246 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-18 18:00:19,246 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-18 18:00:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:19,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:19,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:21,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:21,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:21,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:21,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:21,760 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-18 18:00:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:21,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:21,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-18 18:00:21,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:21,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:27,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:33,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:33,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-18 18:00:33,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:33,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-18 18:00:33,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-18 18:00:33,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 18:00:33,490 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-18 18:00:57,712 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-18 18:00:58,282 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-18 18:00:58,887 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-18 18:00:59,402 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:00:59,894 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:01:00,373 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:01:00,842 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:01:01,323 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:01:01,813 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:01:02,240 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:01:02,635 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:01:03,024 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:01:03,392 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:01:03,740 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:01:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:07,436 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-18 18:01:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-18 18:01:07,436 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-18 18:01:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:07,438 INFO L225 Difference]: With dead ends: 591 [2019-01-18 18:01:07,438 INFO L226 Difference]: Without dead ends: 344 [2019-01-18 18:01:07,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-18 18:01:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-18 18:01:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-18 18:01:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-18 18:01:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-18 18:01:07,486 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-18 18:01:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:07,486 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-18 18:01:07,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-18 18:01:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-18 18:01:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-18 18:01:07,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:07,488 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-18 18:01:07,488 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:07,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-18 18:01:07,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:07,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:07,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:07,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:07,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:09,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:09,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:09,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:09,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:09,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:09,820 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-18 18:01:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:09,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:09,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:09,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:09,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:12,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:12,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-18 18:01:12,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:12,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 18:01:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 18:01:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-18 18:01:12,769 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-18 18:01:25,468 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-18 18:01:25,975 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-18 18:01:26,471 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-18 18:01:26,818 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:01:27,152 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:01:27,560 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:01:27,879 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:01:28,192 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:01:28,496 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:01:28,794 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:01:29,079 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:01:29,358 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:01:29,633 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:01:29,882 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:01:30,130 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:01:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:32,914 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-18 18:01:32,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-18 18:01:32,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-18 18:01:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:32,916 INFO L225 Difference]: With dead ends: 484 [2019-01-18 18:01:32,916 INFO L226 Difference]: Without dead ends: 358 [2019-01-18 18:01:32,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-18 18:01:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-18 18:01:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-18 18:01:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-18 18:01:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-18 18:01:32,968 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-18 18:01:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:32,968 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-18 18:01:32,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 18:01:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-18 18:01:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-18 18:01:32,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:32,970 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-18 18:01:32,970 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-18 18:01:32,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:32,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:32,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:32,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:34,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:34,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:34,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:34,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:34,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:34,428 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-18 18:01:34,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:34,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:34,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:36,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:38,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:38,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-18 18:01:38,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:38,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 18:01:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 18:01:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-18 18:01:38,056 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-18 18:01:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:40,375 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-18 18:01:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 18:01:40,375 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-18 18:01:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:40,376 INFO L225 Difference]: With dead ends: 495 [2019-01-18 18:01:40,376 INFO L226 Difference]: Without dead ends: 236 [2019-01-18 18:01:40,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 18:01:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-18 18:01:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-18 18:01:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-18 18:01:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-18 18:01:40,435 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-18 18:01:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:40,435 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-18 18:01:40,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 18:01:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-18 18:01:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-18 18:01:40,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:40,436 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-18 18:01:40,437 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-18 18:01:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:40,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:43,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:43,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:43,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:43,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 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-18 18:01:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:43,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:43,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-18 18:01:43,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:43,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:50,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:56,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:56,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-18 18:01:56,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:56,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-18 18:01:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-18 18:01:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 18:01:56,276 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-18 18:02:21,818 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-18 18:02:22,410 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-18 18:02:23,061 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-18 18:02:23,633 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-18 18:02:24,173 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:02:24,689 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:02:25,187 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:02:25,668 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:02:26,138 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:02:26,600 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:02:27,030 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:02:27,452 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:02:27,853 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:02:28,254 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:02:28,653 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:02:29,099 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:02:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:32,853 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-18 18:02:32,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-18 18:02:32,854 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-18 18:02:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:32,856 INFO L225 Difference]: With dead ends: 629 [2019-01-18 18:02:32,856 INFO L226 Difference]: Without dead ends: 366 [2019-01-18 18:02:32,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-18 18:02:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-18 18:02:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-18 18:02:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-18 18:02:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-18 18:02:32,912 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-18 18:02:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:32,912 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-18 18:02:32,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-18 18:02:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-18 18:02:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-18 18:02:32,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:32,913 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-18 18:02:32,913 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-18 18:02:32,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:32,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:32,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:35,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:35,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:35,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:35,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:35,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:35,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 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-18 18:02:35,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:35,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:35,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:35,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:35,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:38,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:38,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:38,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-18 18:02:38,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:38,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 18:02:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 18:02:38,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-18 18:02:38,806 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-18 18:02:50,916 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-18 18:02:51,445 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-18 18:02:51,970 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-18 18:02:52,346 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-18 18:02:52,704 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-18 18:02:53,060 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:02:53,406 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:02:53,739 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:02:54,068 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:02:54,446 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:02:54,776 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:02:55,078 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:02:55,370 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:02:55,646 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:02:55,931 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:02:56,196 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:02:56,450 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:02:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:59,257 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-18 18:02:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-18 18:02:59,257 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-18 18:02:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:59,259 INFO L225 Difference]: With dead ends: 514 [2019-01-18 18:02:59,259 INFO L226 Difference]: Without dead ends: 380 [2019-01-18 18:02:59,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 18:02:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-18 18:02:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-18 18:02:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-18 18:02:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-18 18:02:59,318 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-18 18:02:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:59,318 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-18 18:02:59,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 18:02:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-18 18:02:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-18 18:02:59,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:59,319 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-18 18:02:59,319 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-18 18:02:59,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:59,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:59,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:59,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:01,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:01,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:01,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:01,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:03:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:01,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:01,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:03,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:04,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-18 18:03:04,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:04,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 18:03:04,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 18:03:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-18 18:03:04,800 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-18 18:03:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:07,400 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-18 18:03:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 18:03:07,400 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-18 18:03:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:07,402 INFO L225 Difference]: With dead ends: 525 [2019-01-18 18:03:07,402 INFO L226 Difference]: Without dead ends: 250 [2019-01-18 18:03:07,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 18:03:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-18 18:03:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-18 18:03:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-18 18:03:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-18 18:03:07,468 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-18 18:03:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:07,468 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-18 18:03:07,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 18:03:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-18 18:03:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-18 18:03:07,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:07,469 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-18 18:03:07,470 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-18 18:03:07,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:07,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:07,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:10,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:10,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:10,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:10,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:10,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:10,443 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-18 18:03:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:10,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:10,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-18 18:03:10,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:10,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:17,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:25,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:25,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-18 18:03:25,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:25,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-18 18:03:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-18 18:03:25,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:03:25,017 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-18 18:03:52,844 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-18 18:03:53,515 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-18 18:03:54,174 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-18 18:03:54,842 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-18 18:03:55,456 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-18 18:03:56,128 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-18 18:03:56,716 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:03:57,273 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:03:57,824 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:03:58,347 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:03:58,854 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:03:59,357 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:03:59,836 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:04:00,295 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:04:00,742 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:04:01,206 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:04:01,612 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:04:02,002 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:04:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:05,976 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-18 18:04:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-18 18:04:05,976 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-18 18:04:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:05,978 INFO L225 Difference]: With dead ends: 667 [2019-01-18 18:04:05,978 INFO L226 Difference]: Without dead ends: 388 [2019-01-18 18:04:05,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-18 18:04:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-18 18:04:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-18 18:04:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-18 18:04:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-18 18:04:06,044 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-18 18:04:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:06,044 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-18 18:04:06,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-18 18:04:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-18 18:04:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-18 18:04:06,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:06,046 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-18 18:04:06,046 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-18 18:04:06,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:06,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:06,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:06,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:06,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:08,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:08,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:08,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:08,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:08,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:08,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:04:08,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:04:08,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:04:09,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:04:09,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:09,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:12,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:12,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:12,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-18 18:04:12,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:12,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 18:04:12,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 18:04:12,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-18 18:04:12,602 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-18 18:04:26,506 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-18 18:04:27,300 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-18 18:04:27,880 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-18 18:04:28,295 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-18 18:04:28,706 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-18 18:04:29,096 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-18 18:04:29,485 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-18 18:04:29,859 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:04:30,217 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:04:30,578 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:04:30,943 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:04:31,281 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:04:31,644 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:04:32,002 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:04:32,316 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:04:32,617 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:04:32,897 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:04:33,188 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:04:33,458 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:04:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:36,409 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-18 18:04:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-18 18:04:36,409 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-18 18:04:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:36,410 INFO L225 Difference]: With dead ends: 544 [2019-01-18 18:04:36,411 INFO L226 Difference]: Without dead ends: 402 [2019-01-18 18:04:36,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-18 18:04:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-18 18:04:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-18 18:04:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-18 18:04:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-18 18:04:36,475 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-18 18:04:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:36,476 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-18 18:04:36,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 18:04:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-18 18:04:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-18 18:04:36,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:36,477 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-18 18:04:36,478 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-18 18:04:36,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:36,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:36,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:38,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:38,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:38,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:38,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:38,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:38,506 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-18 18:04:38,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:38,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:04:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:38,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:40,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:42,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-18 18:04:42,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:42,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 18:04:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 18:04:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-18 18:04:42,496 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-18 18:04:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:45,267 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-18 18:04:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 18:04:45,267 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-18 18:04:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:45,268 INFO L225 Difference]: With dead ends: 555 [2019-01-18 18:04:45,268 INFO L226 Difference]: Without dead ends: 264 [2019-01-18 18:04:45,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 18:04:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-18 18:04:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-18 18:04:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-18 18:04:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-18 18:04:45,334 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-18 18:04:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:45,334 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-18 18:04:45,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 18:04:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-18 18:04:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-18 18:04:45,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:45,336 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-18 18:04:45,336 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-18 18:04:45,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:45,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:45,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:48,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:48,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:48,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:48,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:48,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:48,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:04:48,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:04:48,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:04:48,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-18 18:04:48,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:48,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:56,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-18 18:05:05,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:05,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-18 18:05:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-18 18:05:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:05:05,088 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-18 18:05:36,510 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-18 18:05:37,223 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-18 18:05:37,971 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-18 18:05:38,669 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-18 18:05:39,310 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-18 18:05:39,985 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-18 18:05:40,578 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-18 18:05:41,162 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-18 18:05:41,736 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:05:42,290 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:05:42,824 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:05:43,428 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:05:43,969 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:05:44,468 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:05:44,949 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:05:45,411 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:05:45,857 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:05:46,295 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:05:46,726 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:05:47,133 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:05:48,659 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-18 18:05:49,957 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-18 18:05:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:51,489 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-18 18:05:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-18 18:05:51,489 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-18 18:05:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:51,491 INFO L225 Difference]: With dead ends: 705 [2019-01-18 18:05:51,492 INFO L226 Difference]: Without dead ends: 410 [2019-01-18 18:05:51,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-18 18:05:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-18 18:05:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-18 18:05:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-18 18:05:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-18 18:05:51,567 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-18 18:05:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:51,567 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-18 18:05:51,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-18 18:05:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-18 18:05:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-18 18:05:51,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:51,568 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-18 18:05:51,569 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-18 18:05:51,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:51,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:51,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:51,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:51,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:55,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:55,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:55,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:55,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:55,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:55,154 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-18 18:05:55,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:05:55,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:05:55,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:05:55,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:55,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:58,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:59,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:59,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-18 18:05:59,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:59,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-18 18:05:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-18 18:05:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-18 18:05:59,169 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-18 18:06:15,875 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-18 18:06:16,528 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-18 18:06:17,186 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-18 18:06:17,645 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-18 18:06:18,101 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-18 18:06:18,544 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-18 18:06:18,979 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-18 18:06:19,497 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-18 18:06:19,932 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-18 18:06:20,341 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-18 18:06:20,723 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-18 18:06:21,104 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-18 18:06:21,477 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-18 18:06:21,841 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-18 18:06:22,197 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-18 18:06:22,540 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-18 18:06:22,888 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-18 18:06:23,212 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-18 18:06:23,516 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-18 18:06:23,808 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-18 18:06:24,095 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-18 18:06:24,434 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-18 18:06:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:06:27,319 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-18 18:06:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-18 18:06:27,319 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-18 18:06:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:06:27,321 INFO L225 Difference]: With dead ends: 574 [2019-01-18 18:06:27,322 INFO L226 Difference]: Without dead ends: 424 [2019-01-18 18:06:27,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-18 18:06:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-18 18:06:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-18 18:06:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-18 18:06:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-18 18:06:27,402 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-18 18:06:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:06:27,402 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-18 18:06:27,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-18 18:06:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-18 18:06:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-18 18:06:27,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:06:27,404 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-18 18:06:27,404 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:06:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:06:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-18 18:06:27,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:06:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:27,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:06:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:27,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:06:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:29,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:29,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:06:29,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:06:29,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:06:29,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:29,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 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-18 18:06:29,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:06:29,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:06:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:29,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:06:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:31,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:06:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:33,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:06:33,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-01-18 18:06:33,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:06:33,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-18 18:06:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-18 18:06:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-01-18 18:06:33,748 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-01-18 18:06:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:06:37,237 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-01-18 18:06:37,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 18:06:37,237 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-01-18 18:06:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:06:37,239 INFO L225 Difference]: With dead ends: 585 [2019-01-18 18:06:37,239 INFO L226 Difference]: Without dead ends: 278 [2019-01-18 18:06:37,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 18:06:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-18 18:06:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-18 18:06:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-18 18:06:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-01-18 18:06:37,316 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-01-18 18:06:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:06:37,316 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-01-18 18:06:37,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-18 18:06:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-01-18 18:06:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-18 18:06:37,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:06:37,317 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-18 18:06:37,317 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:06:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:06:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-01-18 18:06:37,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:06:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:06:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:37,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:06:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:40,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:40,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:06:40,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:06:40,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:06:40,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:40,865 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-18 18:06:40,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:06:40,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:06:40,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-18 18:06:40,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:06:40,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:06:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:50,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:06:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:06:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-01-18 18:06:58,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:06:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-01-18 18:06:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-01-18 18:06:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:06:58,865 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.