java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:38:39,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:38:39,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:38:39,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:38:39,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:38:39,344 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:38:39,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:38:39,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:38:39,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:38:39,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:38:39,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:38:39,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:38:39,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:38:39,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:38:39,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:38:39,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:38:39,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:38:39,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:38:39,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:38:39,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:38:39,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:38:39,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:38:39,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:38:39,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:38:39,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:38:39,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:38:39,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:38:39,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:38:39,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:38:39,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:38:39,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:38:39,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:38:39,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:38:39,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:38:39,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:38:39,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:38:39,374 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:38:39,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:38:39,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:38:39,388 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:38:39,388 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:38:39,388 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:38:39,389 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:38:39,389 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:38:39,389 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:38:39,389 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:38:39,390 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:38:39,390 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:38:39,390 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:38:39,390 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:38:39,390 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:38:39,390 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:38:39,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:38:39,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:38:39,392 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:38:39,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:38:39,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:38:39,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:38:39,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:38:39,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:38:39,393 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:38:39,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:38:39,393 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:38:39,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:38:39,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:38:39,394 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:38:39,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:38:39,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:38:39,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:38:39,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:38:39,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:38:39,395 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:38:39,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:38:39,395 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:38:39,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:38:39,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:38:39,396 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:38:39,396 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:38:39,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:38:39,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:38:39,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:38:39,473 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:38:39,474 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:38:39,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl [2018-12-03 16:38:39,475 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl' [2018-12-03 16:38:39,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:38:39,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:38:39,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:38:39,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:38:39,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:38:39,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:38:39,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:38:39,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:38:39,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:38:39,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... [2018-12-03 16:38:39,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:38:39,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:38:39,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:38:39,602 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:38:39,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:38:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:38:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:38:39,866 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:38:39,867 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:38:39,867 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:38:39 BoogieIcfgContainer [2018-12-03 16:38:39,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:38:39,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:38:39,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:38:39,872 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:38:39,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:39" (1/2) ... [2018-12-03 16:38:39,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d202b0 and model type gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:38:39, skipping insertion in model container [2018-12-03 16:38:39,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:38:39" (2/2) ... [2018-12-03 16:38:39,875 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bpl [2018-12-03 16:38:39,886 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:38:39,893 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:38:39,911 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:38:39,950 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:38:39,950 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:38:39,950 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:38:39,950 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:38:39,950 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:38:39,951 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:38:39,951 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:38:39,951 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:38:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 16:38:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:38:39,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:39,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:38:39,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:39,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2018-12-03 16:38:39,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:40,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:38:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:38:40,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:38:40,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:38:40,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:38:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:38:40,272 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 16:38:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:40,459 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-12-03 16:38:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:38:40,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 16:38:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:40,477 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:38:40,477 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:38:40,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:38:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:38:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:38:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:38:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 16:38:40,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 5 [2018-12-03 16:38:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:40,518 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 16:38:40,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:38:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 16:38:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:38:40,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:40,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:38:40,520 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:40,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash 28696809, now seen corresponding path program 1 times [2018-12-03 16:38:40,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:40,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:38:40,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:38:40,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:38:40,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:38:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:38:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:38:40,556 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 3 states. [2018-12-03 16:38:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:40,596 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2018-12-03 16:38:40,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:38:40,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:38:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:40,598 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:38:40,598 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:38:40,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:38:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:38:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-03 16:38:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:38:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:38:40,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2018-12-03 16:38:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:40,604 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:38:40,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:38:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:38:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:38:40,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:40,606 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-03 16:38:40,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:40,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1872158041, now seen corresponding path program 1 times [2018-12-03 16:38:40,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:40,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:40,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:40,651 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:38:40,653 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [12], [14], [16] [2018-12-03 16:38:40,693 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:38:40,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:38:40,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:38:40,877 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 3 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:38:40,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:38:40,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:40,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:40,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:40,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:40,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:41,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:38:41,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:41,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:38:41,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:38:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:38:41,169 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2018-12-03 16:38:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:41,200 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-12-03 16:38:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:38:41,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 16:38:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:41,202 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:38:41,202 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:38:41,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:38:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:38:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-03 16:38:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:38:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 16:38:41,210 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2018-12-03 16:38:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:41,211 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 16:38:41,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:38:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 16:38:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:38:41,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:41,212 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1] [2018-12-03 16:38:41,212 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:41,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash 306486099, now seen corresponding path program 2 times [2018-12-03 16:38:41,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:41,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:41,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:41,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:41,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:41,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:41,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:41,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:41,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:38:41,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:41,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:41,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:38:41,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:41,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:38:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:38:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:38:41,642 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2018-12-03 16:38:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:41,714 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-12-03 16:38:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:38:41,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 16:38:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:41,716 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:38:41,716 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:38:41,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:38:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:38:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-03 16:38:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:38:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 16:38:41,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-12-03 16:38:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:41,725 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 16:38:41,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:38:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 16:38:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:38:41,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:41,726 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1] [2018-12-03 16:38:41,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:41,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1251716313, now seen corresponding path program 3 times [2018-12-03 16:38:41,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:41,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:41,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:41,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:41,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:41,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:41,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:41,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:41,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:41,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:41,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:41,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:42,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:42,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:38:42,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:42,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:38:42,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:38:42,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:38:42,152 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2018-12-03 16:38:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:42,208 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-12-03 16:38:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:38:42,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-03 16:38:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:42,210 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:38:42,210 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:38:42,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:38:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:38:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-03 16:38:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:38:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 16:38:42,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-12-03 16:38:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:42,221 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 16:38:42,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:38:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 16:38:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:38:42,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:42,222 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 1, 1, 1] [2018-12-03 16:38:42,222 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:42,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1653237037, now seen corresponding path program 4 times [2018-12-03 16:38:42,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:42,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:42,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:42,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:42,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:42,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:42,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:42,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:42,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:42,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:42,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:42,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:42,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:42,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:42,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:42,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:42,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:38:42,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:42,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:38:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:38:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:38:42,780 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2018-12-03 16:38:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:42,893 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-03 16:38:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:38:42,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-03 16:38:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:42,895 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:38:42,895 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:38:42,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:38:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:38:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 16:38:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:38:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 16:38:42,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2018-12-03 16:38:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:42,903 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 16:38:42,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:38:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 16:38:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:38:42,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:42,904 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 1, 1, 1] [2018-12-03 16:38:42,904 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:42,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:42,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1873206361, now seen corresponding path program 5 times [2018-12-03 16:38:42,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:42,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:42,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:38:43,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:43,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:43,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:43,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:43,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:43,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:43,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:38:43,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:43,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:43,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:43,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:43,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2018-12-03 16:38:43,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:43,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:38:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:38:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:38:43,180 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2018-12-03 16:38:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:43,374 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-12-03 16:38:43,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:38:43,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-03 16:38:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:43,375 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:38:43,375 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:38:43,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:38:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:38:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-12-03 16:38:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:38:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-03 16:38:43,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2018-12-03 16:38:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:43,387 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-03 16:38:43,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:38:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-03 16:38:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:38:43,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:43,389 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 3, 1, 1, 1] [2018-12-03 16:38:43,389 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:43,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:43,390 INFO L82 PathProgramCache]: Analyzing trace with hash 270037545, now seen corresponding path program 6 times [2018-12-03 16:38:43,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:43,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:43,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:43,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:43,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:43,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:43,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:43,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:43,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:43,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:43,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:43,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:43,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:38:43,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:43,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:38:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:38:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:38:43,888 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2018-12-03 16:38:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:43,946 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-03 16:38:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:38:43,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-03 16:38:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:43,947 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:38:43,948 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:38:43,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:38:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:38:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-03 16:38:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:38:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-03 16:38:43,956 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2018-12-03 16:38:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:43,956 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-03 16:38:43,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:38:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-03 16:38:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:38:43,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:43,958 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 7, 3, 1, 1, 1] [2018-12-03 16:38:43,958 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:43,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash -41969707, now seen corresponding path program 7 times [2018-12-03 16:38:43,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:43,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:44,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:44,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:44,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:44,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:44,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:44,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:44,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:44,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:38:44,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:44,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:38:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:38:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:38:44,432 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2018-12-03 16:38:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:44,489 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-03 16:38:44,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:38:44,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-03 16:38:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:44,490 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:38:44,490 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:38:44,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:38:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:38:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-03 16:38:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:38:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-12-03 16:38:44,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 32 [2018-12-03 16:38:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:44,500 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-03 16:38:44,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:38:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-12-03 16:38:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:38:44,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:44,501 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 1, 1, 1] [2018-12-03 16:38:44,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:44,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:44,501 INFO L82 PathProgramCache]: Analyzing trace with hash -740785495, now seen corresponding path program 8 times [2018-12-03 16:38:44,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:44,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:44,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:44,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:44,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:38:44,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:44,658 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:44,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:44,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:44,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:44,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:38:44,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:44,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 112 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:44,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 112 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:44,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:44,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2018-12-03 16:38:44,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:44,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:38:44,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:38:44,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:38:44,862 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 15 states. [2018-12-03 16:38:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:45,194 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-12-03 16:38:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:38:45,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-12-03 16:38:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:45,200 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:38:45,200 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:38:45,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:38:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:38:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-12-03 16:38:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:38:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-03 16:38:45,220 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 35 [2018-12-03 16:38:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:45,220 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-03 16:38:45,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:38:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-03 16:38:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:38:45,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:45,222 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 1, 1, 1] [2018-12-03 16:38:45,223 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:45,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1379041817, now seen corresponding path program 9 times [2018-12-03 16:38:45,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:45,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:45,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:45,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 96 proven. 126 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:45,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:45,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:45,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:45,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:45,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:45,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:45,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:45,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:45,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:45,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:45,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 96 proven. 126 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:45,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 96 proven. 126 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:46,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:46,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:38:46,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:46,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:38:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:38:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:38:46,145 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-12-03 16:38:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:46,266 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-03 16:38:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:38:46,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-03 16:38:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:46,268 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:38:46,268 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:38:46,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:38:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:38:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-03 16:38:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:38:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-03 16:38:46,282 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 41 [2018-12-03 16:38:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:46,282 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-03 16:38:46,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:38:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-03 16:38:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:38:46,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:46,284 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 10, 4, 1, 1, 1] [2018-12-03 16:38:46,284 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:46,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash -391282285, now seen corresponding path program 10 times [2018-12-03 16:38:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:46,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:46,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:46,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:46,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:46,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:46,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:46,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:46,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:46,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:46,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:46,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:46,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:47,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:47,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:38:47,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:47,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:38:47,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:38:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:38:47,205 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2018-12-03 16:38:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:47,539 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-12-03 16:38:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:38:47,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-03 16:38:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:47,540 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:38:47,540 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:38:47,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:38:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:38:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 16:38:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:38:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-03 16:38:47,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 44 [2018-12-03 16:38:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:47,560 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-03 16:38:47,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:38:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-03 16:38:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:38:47,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:47,563 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 11, 4, 1, 1, 1] [2018-12-03 16:38:47,563 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:47,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1131990631, now seen corresponding path program 11 times [2018-12-03 16:38:47,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:47,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:38:47,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:47,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:47,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:47,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:47,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:47,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:47,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:47,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:48,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:38:48,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:48,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 209 proven. 34 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-03 16:38:48,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 209 proven. 34 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-03 16:38:48,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:48,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2018-12-03 16:38:48,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:48,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:38:48,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:38:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:38:48,299 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 19 states. [2018-12-03 16:38:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:48,625 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-12-03 16:38:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:38:48,626 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-03 16:38:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:48,627 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:38:48,627 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:38:48,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:38:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:38:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-12-03 16:38:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:38:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 16:38:48,644 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 47 [2018-12-03 16:38:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:48,644 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 16:38:48,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:38:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 16:38:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:38:48,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:48,646 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 12, 5, 1, 1, 1] [2018-12-03 16:38:48,646 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:48,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -969108631, now seen corresponding path program 12 times [2018-12-03 16:38:48,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:48,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:48,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:48,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 164 proven. 222 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:48,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:48,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:48,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:48,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:48,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:48,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:48,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:48,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:48,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:48,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:48,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 164 proven. 222 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:48,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 164 proven. 222 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:49,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:49,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:38:49,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:49,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:38:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:38:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:38:49,427 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 15 states. [2018-12-03 16:38:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:49,537 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-12-03 16:38:49,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:38:49,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-03 16:38:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:49,540 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:38:49,540 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:38:49,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:38:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:38:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 16:38:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:38:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-03 16:38:49,561 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 53 [2018-12-03 16:38:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:49,562 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-03 16:38:49,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:38:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-03 16:38:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:38:49,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:49,564 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 13, 5, 1, 1, 1] [2018-12-03 16:38:49,565 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:49,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2050520341, now seen corresponding path program 13 times [2018-12-03 16:38:49,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:49,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:49,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:49,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:49,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:49,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:49,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:49,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:49,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:49,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:49,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:49,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:49,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:49,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:49,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:50,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:38:50,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:50,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:38:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:38:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:38:50,310 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 16 states. [2018-12-03 16:38:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:50,392 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-03 16:38:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:38:50,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-12-03 16:38:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:50,400 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:38:50,400 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:38:50,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:38:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:38:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-03 16:38:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:38:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-03 16:38:50,415 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 56 [2018-12-03 16:38:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:50,415 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-03 16:38:50,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:38:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-03 16:38:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:38:50,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:50,416 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 14, 5, 1, 1, 1] [2018-12-03 16:38:50,416 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:50,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1727210473, now seen corresponding path program 14 times [2018-12-03 16:38:50,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:38:50,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:50,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:50,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:50,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:50,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:50,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:50,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:50,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 16:38:50,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:50,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 336 proven. 57 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 16:38:50,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 336 proven. 57 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 16:38:50,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:50,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 23 [2018-12-03 16:38:50,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:50,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:38:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:38:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:38:50,989 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 23 states. [2018-12-03 16:38:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:51,651 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2018-12-03 16:38:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:38:51,653 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-12-03 16:38:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:51,654 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:38:51,654 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:38:51,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 101 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=547, Invalid=1259, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:38:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:38:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-12-03 16:38:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:38:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-12-03 16:38:51,675 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 59 [2018-12-03 16:38:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:51,675 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-12-03 16:38:51,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:38:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-12-03 16:38:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:38:51,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:51,676 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 15, 6, 1, 1, 1] [2018-12-03 16:38:51,677 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:51,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1530980185, now seen corresponding path program 15 times [2018-12-03 16:38:51,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:51,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:51,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 250 proven. 345 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:51,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:51,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:51,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:51,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:51,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:51,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:51,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:51,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:51,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:51,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:51,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 250 proven. 345 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:51,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 250 proven. 345 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:52,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:52,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:38:52,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:52,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:38:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:38:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:38:52,651 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 18 states. [2018-12-03 16:38:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:52,732 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-12-03 16:38:52,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:38:52,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-12-03 16:38:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:52,734 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:38:52,734 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:38:52,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:38:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:38:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-12-03 16:38:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:38:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-12-03 16:38:52,751 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 65 [2018-12-03 16:38:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:52,752 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-12-03 16:38:52,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:38:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-12-03 16:38:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:38:52,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:52,753 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 16, 6, 1, 1, 1] [2018-12-03 16:38:52,753 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:52,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1594238893, now seen corresponding path program 16 times [2018-12-03 16:38:52,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:52,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:52,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:53,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:53,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:53,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:53,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:53,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:53,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:53,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:53,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:53,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:53,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:53,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:38:53,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:53,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:38:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:38:53,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:53,885 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 19 states. [2018-12-03 16:38:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:54,094 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-12-03 16:38:54,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:38:54,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2018-12-03 16:38:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:54,095 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:38:54,095 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:38:54,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:38:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 16:38:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:38:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-12-03 16:38:54,108 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 68 [2018-12-03 16:38:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:54,109 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-12-03 16:38:54,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:38:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-12-03 16:38:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:38:54,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:54,109 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 17, 6, 1, 1, 1] [2018-12-03 16:38:54,110 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:54,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash -643765977, now seen corresponding path program 17 times [2018-12-03 16:38:54,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:54,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:54,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:54,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:54,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 16:38:54,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:54,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:54,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:54,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:54,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:54,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:54,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:54,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:54,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:38:54,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:54,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 493 proven. 86 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 16:38:54,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 493 proven. 86 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 16:38:55,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 27 [2018-12-03 16:38:55,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:38:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:38:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:38:55,015 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 27 states. [2018-12-03 16:38:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:55,629 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-03 16:38:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:38:55,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 16:38:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:55,631 INFO L225 Difference]: With dead ends: 116 [2018-12-03 16:38:55,631 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:38:55,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 122 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=758, Invalid=1792, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:38:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:38:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-12-03 16:38:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:38:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-03 16:38:55,652 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 71 [2018-12-03 16:38:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:55,652 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-03 16:38:55,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:38:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-03 16:38:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:38:55,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:55,653 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 18, 7, 1, 1, 1] [2018-12-03 16:38:55,653 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:55,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1103739735, now seen corresponding path program 18 times [2018-12-03 16:38:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:55,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:55,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 354 proven. 495 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:55,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:55,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:55,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:55,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:55,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:55,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:56,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:56,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:56,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:56,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:56,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 354 proven. 495 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:56,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 354 proven. 495 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:56,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:56,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:38:56,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:56,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:38:56,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:38:56,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:38:56,476 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 21 states. [2018-12-03 16:38:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:56,553 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2018-12-03 16:38:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:38:56,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 77 [2018-12-03 16:38:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:56,554 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:38:56,554 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:38:56,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:38:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:38:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-03 16:38:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:38:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-12-03 16:38:56,569 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 77 [2018-12-03 16:38:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:56,569 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-12-03 16:38:56,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:38:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-12-03 16:38:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:38:56,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:56,570 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 19, 7, 1, 1, 1] [2018-12-03 16:38:56,570 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:56,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash 894624341, now seen corresponding path program 19 times [2018-12-03 16:38:56,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:56,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:56,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:56,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:56,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:56,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:56,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:56,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:56,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:56,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:56,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:56,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:56,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:56,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:38:57,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:57,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:38:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:38:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:38:57,415 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 22 states. [2018-12-03 16:38:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:57,490 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2018-12-03 16:38:57,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:38:57,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2018-12-03 16:38:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:57,491 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:38:57,491 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:38:57,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:38:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:38:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-03 16:38:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:38:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-12-03 16:38:57,508 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 80 [2018-12-03 16:38:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:57,509 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-12-03 16:38:57,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:38:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-12-03 16:38:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:38:57,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:57,509 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 20, 7, 1, 1, 1] [2018-12-03 16:38:57,510 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:57,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1617122601, now seen corresponding path program 20 times [2018-12-03 16:38:57,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:57,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:57,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:57,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:57,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 16:38:57,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:57,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:57,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:57,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:57,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:57,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:57,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:57,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 16:38:57,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:57,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 680 proven. 121 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-03 16:38:58,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 680 proven. 121 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-03 16:38:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:58,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10, 10] total 31 [2018-12-03 16:38:58,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:58,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:38:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:38:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=633, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:38:58,455 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 31 states. [2018-12-03 16:38:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:58,915 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2018-12-03 16:38:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:38:58,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2018-12-03 16:38:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:58,916 INFO L225 Difference]: With dead ends: 134 [2018-12-03 16:38:58,916 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:38:58,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 143 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1003, Invalid=2419, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:38:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:38:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-12-03 16:38:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:38:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-12-03 16:38:58,936 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 83 [2018-12-03 16:38:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:58,936 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-12-03 16:38:58,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:38:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-12-03 16:38:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:38:58,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:58,937 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 21, 8, 1, 1, 1] [2018-12-03 16:38:58,937 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:58,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1146805401, now seen corresponding path program 21 times [2018-12-03 16:38:58,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:58,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:58,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 476 proven. 672 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:38:59,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:59,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:59,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:59,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:59,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:59,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:59,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:59,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:59,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:59,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:59,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 476 proven. 672 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:38:59,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 476 proven. 672 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:39:00,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:00,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:39:00,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:00,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:39:00,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:39:00,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:00,161 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 24 states. [2018-12-03 16:39:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:00,252 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-12-03 16:39:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:39:00,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 89 [2018-12-03 16:39:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:00,254 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:39:00,254 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:39:00,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:39:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-12-03 16:39:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:39:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-12-03 16:39:00,275 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 89 [2018-12-03 16:39:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:00,276 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-12-03 16:39:00,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:39:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-12-03 16:39:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:39:00,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:00,276 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 22, 8, 1, 1, 1] [2018-12-03 16:39:00,276 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:00,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash 63348499, now seen corresponding path program 22 times [2018-12-03 16:39:00,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:00,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:00,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:39:01,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:01,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:01,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:01,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:01,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:01,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:01,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:01,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:39:01,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:39:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:39:01,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:01,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:39:01,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:39:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:39:01,995 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 25 states. [2018-12-03 16:39:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:02,131 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-12-03 16:39:02,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:39:02,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2018-12-03 16:39:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:02,132 INFO L225 Difference]: With dead ends: 124 [2018-12-03 16:39:02,132 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:39:02,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:39:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:39:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 16:39:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:39:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-03 16:39:02,155 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 92 [2018-12-03 16:39:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:02,156 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-03 16:39:02,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:39:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-03 16:39:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:39:02,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:02,157 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 23, 8, 1, 1, 1] [2018-12-03 16:39:02,157 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:02,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash -197299225, now seen corresponding path program 23 times [2018-12-03 16:39:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:02,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:02,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 16:39:02,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:02,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:02,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:02,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:02,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:02,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:02,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:02,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:02,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:39:02,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:02,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 897 proven. 162 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-12-03 16:39:02,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 897 proven. 162 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-12-03 16:39:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 11] total 35 [2018-12-03 16:39:02,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:02,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:39:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:39:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=811, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:39:02,979 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 35 states. [2018-12-03 16:39:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:03,752 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2018-12-03 16:39:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:39:03,752 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 95 [2018-12-03 16:39:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:03,753 INFO L225 Difference]: With dead ends: 152 [2018-12-03 16:39:03,753 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:39:03,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 164 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1282, Invalid=3140, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:39:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:39:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2018-12-03 16:39:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:39:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-12-03 16:39:03,781 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 95 [2018-12-03 16:39:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:03,781 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-12-03 16:39:03,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:39:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-12-03 16:39:03,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:39:03,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:03,783 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 24, 9, 1, 1, 1] [2018-12-03 16:39:03,783 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:03,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash 857310697, now seen corresponding path program 24 times [2018-12-03 16:39:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:03,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:03,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 616 proven. 876 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:04,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:04,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:04,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:04,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:04,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:04,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:04,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:04,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:04,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:04,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:04,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 616 proven. 876 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:04,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 616 proven. 876 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:05,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:05,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:39:05,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:05,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:39:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:39:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:05,026 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 27 states. [2018-12-03 16:39:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:05,167 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2018-12-03 16:39:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:39:05,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 101 [2018-12-03 16:39:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:05,169 INFO L225 Difference]: With dead ends: 136 [2018-12-03 16:39:05,169 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:39:05,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:39:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-03 16:39:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:39:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-12-03 16:39:05,195 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 101 [2018-12-03 16:39:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:05,195 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-12-03 16:39:05,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:39:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-12-03 16:39:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:39:05,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:05,196 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 25, 9, 1, 1, 1] [2018-12-03 16:39:05,196 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:05,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2048729195, now seen corresponding path program 25 times [2018-12-03 16:39:05,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:05,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:05,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:05,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:05,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:05,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:05,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:05,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:05,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:05,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:05,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:05,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:06,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:06,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 16:39:06,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:06,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:39:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:39:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:06,406 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 28 states. [2018-12-03 16:39:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:06,650 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2018-12-03 16:39:06,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:39:06,651 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-12-03 16:39:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:06,652 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:39:06,652 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:39:06,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:39:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-12-03 16:39:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:39:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-12-03 16:39:06,682 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 104 [2018-12-03 16:39:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:06,682 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-12-03 16:39:06,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:39:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-12-03 16:39:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:39:06,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:06,683 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 26, 9, 1, 1, 1] [2018-12-03 16:39:06,683 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:06,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:06,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2067601001, now seen corresponding path program 26 times [2018-12-03 16:39:06,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:06,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:06,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:06,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 16:39:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:08,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:08,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:08,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:08,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:08,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:08,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:08,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:39:08,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:08,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1144 proven. 209 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-12-03 16:39:08,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1144 proven. 209 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-12-03 16:39:08,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:08,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 12] total 39 [2018-12-03 16:39:08,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:08,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:39:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:39:08,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=1011, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:39:08,902 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 39 states. [2018-12-03 16:39:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:09,808 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2018-12-03 16:39:09,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:39:09,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 107 [2018-12-03 16:39:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:09,814 INFO L225 Difference]: With dead ends: 170 [2018-12-03 16:39:09,814 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:39:09,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 185 SyntacticMatches, 18 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1595, Invalid=3955, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:39:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:39:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-12-03 16:39:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:39:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-12-03 16:39:09,857 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 107 [2018-12-03 16:39:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:09,858 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-12-03 16:39:09,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:39:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-12-03 16:39:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:39:09,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:09,859 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 27, 10, 1, 1, 1] [2018-12-03 16:39:09,859 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:09,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash -756310489, now seen corresponding path program 27 times [2018-12-03 16:39:09,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:09,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:09,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:10,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:10,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:10,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:10,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:10,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:10,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:10,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:10,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:10,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:10,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:10,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:12,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:12,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 16:39:12,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:12,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:39:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:39:12,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:12,756 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 30 states. [2018-12-03 16:39:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:12,956 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2018-12-03 16:39:12,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:39:12,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 113 [2018-12-03 16:39:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:12,958 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:39:12,958 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 16:39:12,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 197 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 16:39:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-12-03 16:39:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:39:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-12-03 16:39:12,995 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 113 [2018-12-03 16:39:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:12,995 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-12-03 16:39:12,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:39:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-12-03 16:39:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:39:12,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:12,996 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 28, 10, 1, 1, 1] [2018-12-03 16:39:12,996 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:12,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 226481619, now seen corresponding path program 28 times [2018-12-03 16:39:12,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:12,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:12,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:14,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:14,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:14,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:14,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:14,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:14,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:14,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:14,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:14,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:14,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:15,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:15,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 16:39:15,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:15,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:39:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:39:15,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:15,273 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 31 states. [2018-12-03 16:39:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:15,455 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2018-12-03 16:39:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:39:15,455 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2018-12-03 16:39:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:15,456 INFO L225 Difference]: With dead ends: 154 [2018-12-03 16:39:15,457 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:39:15,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 202 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:39:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 16:39:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:39:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-12-03 16:39:15,492 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 116 [2018-12-03 16:39:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:15,492 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-12-03 16:39:15,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:39:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-12-03 16:39:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 16:39:15,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:15,493 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 29, 10, 1, 1, 1] [2018-12-03 16:39:15,493 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:15,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -205885785, now seen corresponding path program 29 times [2018-12-03 16:39:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:15,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:15,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-03 16:39:15,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:15,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:15,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:15,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:15,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:15,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:15,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:15,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:16,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:39:16,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:16,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1421 proven. 262 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-12-03 16:39:16,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1421 proven. 262 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-12-03 16:39:16,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:16,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 13] total 43 [2018-12-03 16:39:16,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:16,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:39:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:39:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1233, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:39:16,588 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 43 states. [2018-12-03 16:39:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:17,376 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2018-12-03 16:39:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:39:17,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 119 [2018-12-03 16:39:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:17,377 INFO L225 Difference]: With dead ends: 188 [2018-12-03 16:39:17,377 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:39:17,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 206 SyntacticMatches, 20 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1942, Invalid=4864, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:39:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:39:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-12-03 16:39:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:39:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-12-03 16:39:17,419 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 119 [2018-12-03 16:39:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:17,419 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-12-03 16:39:17,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:39:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-12-03 16:39:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 16:39:17,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:17,420 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 30, 11, 1, 1, 1] [2018-12-03 16:39:17,421 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:17,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1090148137, now seen corresponding path program 30 times [2018-12-03 16:39:17,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:17,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:17,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 950 proven. 1365 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:17,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:17,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:17,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:17,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:17,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:17,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:17,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:17,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:18,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:18,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:18,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 950 proven. 1365 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:18,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 950 proven. 1365 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:19,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:19,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 16:39:19,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:19,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:39:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:39:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:19,311 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 33 states. [2018-12-03 16:39:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:19,460 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2018-12-03 16:39:19,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:39:19,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 125 [2018-12-03 16:39:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:19,462 INFO L225 Difference]: With dead ends: 166 [2018-12-03 16:39:19,462 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:39:19,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 218 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:39:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-03 16:39:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 16:39:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-12-03 16:39:19,506 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 125 [2018-12-03 16:39:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:19,506 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-12-03 16:39:19,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:39:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-12-03 16:39:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:39:19,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:19,507 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 31, 11, 1, 1, 1] [2018-12-03 16:39:19,507 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:19,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1543738155, now seen corresponding path program 31 times [2018-12-03 16:39:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:19,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:19,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:19,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:19,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:19,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:19,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:19,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:19,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:20,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:20,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:20,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:20,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:20,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:20,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 16:39:20,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:20,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:39:20,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:39:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:20,878 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 34 states. [2018-12-03 16:39:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:21,072 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2018-12-03 16:39:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:39:21,072 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2018-12-03 16:39:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:21,074 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:39:21,074 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:39:21,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 223 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:39:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-03 16:39:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:39:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-12-03 16:39:21,124 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 128 [2018-12-03 16:39:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:21,124 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-12-03 16:39:21,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:39:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-12-03 16:39:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:39:21,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:21,125 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 32, 11, 1, 1, 1] [2018-12-03 16:39:21,126 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:21,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1402234793, now seen corresponding path program 32 times [2018-12-03 16:39:21,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:21,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:21,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:39:21,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:21,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:21,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:21,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:21,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:21,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:21,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:21,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:21,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 16:39:21,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:21,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1728 proven. 321 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:39:22,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1728 proven. 321 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:39:22,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:22,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 14, 14] total 47 [2018-12-03 16:39:22,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:22,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:39:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:39:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=1477, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:39:22,666 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 47 states. [2018-12-03 16:39:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:24,587 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2018-12-03 16:39:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:39:24,587 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 131 [2018-12-03 16:39:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:24,588 INFO L225 Difference]: With dead ends: 206 [2018-12-03 16:39:24,589 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 16:39:24,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 227 SyntacticMatches, 22 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2323, Invalid=5867, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 16:39:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 16:39:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 138. [2018-12-03 16:39:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:39:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-12-03 16:39:24,637 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 131 [2018-12-03 16:39:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:24,638 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-12-03 16:39:24,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:39:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-12-03 16:39:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:39:24,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:24,638 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 33, 12, 1, 1, 1] [2018-12-03 16:39:24,639 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:24,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1241417959, now seen corresponding path program 33 times [2018-12-03 16:39:24,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:24,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:24,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:24,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1144 proven. 1650 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-03 16:39:25,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:25,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:25,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:25,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:25,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:25,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:25,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:25,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:25,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:25,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 298 proven. 2667 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:39:25,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 298 proven. 2667 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:39:26,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:26,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 44, 44] total 51 [2018-12-03 16:39:26,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:26,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:39:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:39:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:26,515 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 45 states. [2018-12-03 16:39:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:26,843 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2018-12-03 16:39:26,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:39:26,844 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 137 [2018-12-03 16:39:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:26,845 INFO L225 Difference]: With dead ends: 208 [2018-12-03 16:39:26,845 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 16:39:26,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 221 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 16:39:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-12-03 16:39:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 16:39:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-12-03 16:39:26,935 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 137 [2018-12-03 16:39:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:26,935 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-12-03 16:39:26,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:39:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-12-03 16:39:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 16:39:26,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:26,936 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 43, 12, 1, 1, 1] [2018-12-03 16:39:26,936 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:26,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1120314521, now seen corresponding path program 34 times [2018-12-03 16:39:26,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:26,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:26,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1484 proven. 2795 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-03 16:39:28,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:28,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:28,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:28,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:28,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:28,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:28,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:28,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:28,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1484 proven. 2795 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-03 16:39:28,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1484 proven. 2795 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-03 16:39:29,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:29,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 16:39:29,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:29,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:39:29,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:39:29,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:29,586 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 46 states. [2018-12-03 16:39:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:29,794 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2018-12-03 16:39:29,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:39:29,795 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 167 [2018-12-03 16:39:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:29,797 INFO L225 Difference]: With dead ends: 211 [2018-12-03 16:39:29,797 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 16:39:29,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 289 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 16:39:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-12-03 16:39:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 16:39:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2018-12-03 16:39:29,867 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 167 [2018-12-03 16:39:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:29,868 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2018-12-03 16:39:29,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:39:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2018-12-03 16:39:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 16:39:29,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:29,869 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 44, 12, 1, 1, 1] [2018-12-03 16:39:29,869 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:29,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1547199981, now seen corresponding path program 35 times [2018-12-03 16:39:29,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:29,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:29,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:29,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:29,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 1518 proven. 2926 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-03 16:39:31,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:31,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:31,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:31,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:31,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:31,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:31,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:31,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:31,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:39:31,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:31,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 2713 proven. 386 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 16:39:31,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 2713 proven. 386 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 16:39:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:32,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 15, 15] total 60 [2018-12-03 16:39:32,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:32,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:39:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:39:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1185, Invalid=2355, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:39:32,507 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand 60 states. [2018-12-03 16:39:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:34,530 INFO L93 Difference]: Finished difference Result 251 states and 289 transitions. [2018-12-03 16:39:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:39:34,530 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 170 [2018-12-03 16:39:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:34,532 INFO L225 Difference]: With dead ends: 251 [2018-12-03 16:39:34,532 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 16:39:34,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 302 SyntacticMatches, 24 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3477 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3989, Invalid=9583, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 16:39:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 16:39:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2018-12-03 16:39:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:39:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2018-12-03 16:39:34,630 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 170 [2018-12-03 16:39:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:34,630 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2018-12-03 16:39:34,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:39:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2018-12-03 16:39:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 16:39:34,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:34,631 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 45, 13, 1, 1, 1] [2018-12-03 16:39:34,632 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:34,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash -904902635, now seen corresponding path program 36 times [2018-12-03 16:39:34,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:34,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:34,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1689 proven. 3060 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:35,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:35,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:35,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:35,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:35,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:35,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:35,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:36,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:36,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:36,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1689 proven. 3060 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:36,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1689 proven. 3060 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:37,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:37,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 16:39:37,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:37,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:39:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:39:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:37,017 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 48 states. [2018-12-03 16:39:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:37,255 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2018-12-03 16:39:37,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:39:37,256 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 176 [2018-12-03 16:39:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:37,257 INFO L225 Difference]: With dead ends: 223 [2018-12-03 16:39:37,257 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:39:37,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 305 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:39:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-12-03 16:39:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 16:39:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2018-12-03 16:39:37,328 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 176 [2018-12-03 16:39:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:37,328 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-12-03 16:39:37,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:39:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2018-12-03 16:39:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 16:39:37,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:37,329 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 46, 13, 1, 1, 1] [2018-12-03 16:39:37,329 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:37,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1308609257, now seen corresponding path program 37 times [2018-12-03 16:39:37,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:37,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:37,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1726 proven. 3197 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:38,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:38,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:38,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:38,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:38,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:38,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:38,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:38,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:38,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1726 proven. 3197 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:38,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1726 proven. 3197 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:41,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:41,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 16:39:41,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:41,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:39:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:39:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:41,093 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 49 states. [2018-12-03 16:39:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:41,358 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2018-12-03 16:39:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:39:41,358 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 179 [2018-12-03 16:39:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:41,359 INFO L225 Difference]: With dead ends: 226 [2018-12-03 16:39:41,360 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 16:39:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 310 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 16:39:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-12-03 16:39:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 16:39:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2018-12-03 16:39:41,430 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 179 [2018-12-03 16:39:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:41,430 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2018-12-03 16:39:41,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:39:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2018-12-03 16:39:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 16:39:41,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:41,432 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 47, 13, 1, 1, 1] [2018-12-03 16:39:41,432 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:41,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash -886478955, now seen corresponding path program 38 times [2018-12-03 16:39:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:41,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 1763 proven. 3337 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:39:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:42,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:42,613 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:42,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:42,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:42,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:42,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:42,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 16:39:42,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:42,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3134 proven. 457 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2018-12-03 16:39:43,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3134 proven. 457 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2018-12-03 16:39:43,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:43,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 16, 16] total 64 [2018-12-03 16:39:43,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:43,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:39:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:39:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1344, Invalid=2688, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:39:43,691 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand 64 states. [2018-12-03 16:39:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:45,512 INFO L93 Difference]: Finished difference Result 269 states and 310 transitions. [2018-12-03 16:39:45,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:39:45,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 182 [2018-12-03 16:39:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:45,513 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:39:45,514 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 16:39:45,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 323 SyntacticMatches, 26 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4010 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4528, Invalid=10972, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:39:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 16:39:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2018-12-03 16:39:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 16:39:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2018-12-03 16:39:45,597 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 182 [2018-12-03 16:39:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:45,597 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2018-12-03 16:39:45,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:39:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2018-12-03 16:39:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 16:39:45,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:45,598 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 48, 14, 1, 1, 1] [2018-12-03 16:39:45,598 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:45,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 949440851, now seen corresponding path program 39 times [2018-12-03 16:39:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:45,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:45,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 1946 proven. 3480 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-03 16:39:46,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:46,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:46,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:46,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:46,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:46,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:46,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:46,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:46,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:46,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:46,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 1946 proven. 3480 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-03 16:39:46,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 1946 proven. 3480 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-03 16:39:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 16:39:47,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:47,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:39:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:39:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:47,890 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand 51 states. [2018-12-03 16:39:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:48,181 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2018-12-03 16:39:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:39:48,182 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 188 [2018-12-03 16:39:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:48,183 INFO L225 Difference]: With dead ends: 238 [2018-12-03 16:39:48,183 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 16:39:48,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 326 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 16:39:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-12-03 16:39:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 16:39:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2018-12-03 16:39:48,269 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 188 [2018-12-03 16:39:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:48,269 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2018-12-03 16:39:48,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:39:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2018-12-03 16:39:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 16:39:48,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:48,270 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 49, 14, 1, 1, 1] [2018-12-03 16:39:48,270 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:48,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1540699687, now seen corresponding path program 40 times [2018-12-03 16:39:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:48,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:48,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 1986 proven. 3626 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-03 16:39:50,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:50,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:50,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:50,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:50,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:50,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:50,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:50,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:50,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 1986 proven. 3626 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-03 16:39:50,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 1986 proven. 3626 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-03 16:39:51,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:39:51,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:51,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:39:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:39:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:51,250 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand 52 states. [2018-12-03 16:39:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:51,572 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2018-12-03 16:39:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:39:51,573 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 191 [2018-12-03 16:39:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:51,574 INFO L225 Difference]: With dead ends: 252 [2018-12-03 16:39:51,575 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 16:39:51,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 331 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 16:39:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 195. [2018-12-03 16:39:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 16:39:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 209 transitions. [2018-12-03 16:39:51,658 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 209 transitions. Word has length 191 [2018-12-03 16:39:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:51,658 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 209 transitions. [2018-12-03 16:39:51,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:39:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 209 transitions. [2018-12-03 16:39:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 16:39:51,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:51,659 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 50, 14, 1, 1, 1] [2018-12-03 16:39:51,659 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:51,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2071802067, now seen corresponding path program 41 times [2018-12-03 16:39:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:51,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:51,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3986 proven. 534 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2018-12-03 16:39:52,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:52,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:52,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:52,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:52,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:52,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:52,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:52,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 16:39:52,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:52,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3585 proven. 534 refuted. 0 times theorem prover too weak. 1929 trivial. 0 not checked. [2018-12-03 16:39:52,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3585 proven. 534 refuted. 0 times theorem prover too weak. 1929 trivial. 0 not checked. [2018-12-03 16:39:52,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:52,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 21 [2018-12-03 16:39:52,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:52,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:39:52,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:39:52,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:39:52,428 INFO L87 Difference]: Start difference. First operand 195 states and 209 transitions. Second operand 21 states. [2018-12-03 16:39:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:53,231 INFO L93 Difference]: Finished difference Result 412 states and 500 transitions. [2018-12-03 16:39:53,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:39:53,231 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2018-12-03 16:39:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:53,235 INFO L225 Difference]: With dead ends: 412 [2018-12-03 16:39:53,235 INFO L226 Difference]: Without dead ends: 410 [2018-12-03 16:39:53,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 374 SyntacticMatches, 28 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:39:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-03 16:39:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 210. [2018-12-03 16:39:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 16:39:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 229 transitions. [2018-12-03 16:39:53,355 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 229 transitions. Word has length 194 [2018-12-03 16:39:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:53,355 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 229 transitions. [2018-12-03 16:39:53,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:39:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 229 transitions. [2018-12-03 16:39:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 16:39:53,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:53,357 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 50, 19, 1, 1, 1] [2018-12-03 16:39:53,357 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:53,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 610401065, now seen corresponding path program 42 times [2018-12-03 16:39:53,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:53,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:53,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 5974 proven. 1009 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:39:55,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:55,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:55,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:55,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:55,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:55,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:55,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:55,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:55,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:55,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:55,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 5974 proven. 1009 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:39:55,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 5974 proven. 1009 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:39:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 83 [2018-12-03 16:39:56,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:56,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:39:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:39:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:39:56,261 INFO L87 Difference]: Start difference. First operand 210 states and 229 transitions. Second operand 53 states. [2018-12-03 16:40:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:00,195 INFO L93 Difference]: Finished difference Result 2068 states and 2726 transitions. [2018-12-03 16:40:00,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:40:00,195 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 209 [2018-12-03 16:40:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:00,203 INFO L225 Difference]: With dead ends: 2068 [2018-12-03 16:40:00,204 INFO L226 Difference]: Without dead ends: 2066 [2018-12-03 16:40:00,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4639 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:40:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-12-03 16:40:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 306. [2018-12-03 16:40:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 16:40:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 357 transitions. [2018-12-03 16:40:00,915 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 357 transitions. Word has length 209 [2018-12-03 16:40:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:00,915 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 357 transitions. [2018-12-03 16:40:00,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:40:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 357 transitions. [2018-12-03 16:40:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-03 16:40:00,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:00,917 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1] [2018-12-03 16:40:00,917 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:00,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1270384855, now seen corresponding path program 43 times [2018-12-03 16:40:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:00,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:00,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-12-03 16:40:02,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:02,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:02,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:02,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:02,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:02,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:02,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:02,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:02,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:06,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 103, 103] total 104 [2018-12-03 16:40:09,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:09,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:40:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:40:09,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=9231, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:40:09,362 INFO L87 Difference]: Start difference. First operand 306 states and 357 transitions. Second operand 104 states. [2018-12-03 16:40:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:27,632 INFO L93 Difference]: Finished difference Result 4434 states and 5812 transitions. [2018-12-03 16:40:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:40:27,633 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 305 [2018-12-03 16:40:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:27,646 INFO L225 Difference]: With dead ends: 4434 [2018-12-03 16:40:27,646 INFO L226 Difference]: Without dead ends: 4278 [2018-12-03 16:40:27,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 509 SyntacticMatches, 52 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1481, Invalid=9231, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:40:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2018-12-03 16:40:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 4180. [2018-12-03 16:40:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4180 states. [2018-12-03 16:40:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 4180 states and 4280 transitions. [2018-12-03 16:40:39,406 INFO L78 Accepts]: Start accepts. Automaton has 4180 states and 4280 transitions. Word has length 305 [2018-12-03 16:40:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:39,406 INFO L480 AbstractCegarLoop]: Abstraction has 4180 states and 4280 transitions. [2018-12-03 16:40:39,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:40:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4180 states and 4280 transitions. [2018-12-03 16:40:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-03 16:40:39,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:39,408 INFO L402 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1] [2018-12-03 16:40:39,408 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1218035091, now seen corresponding path program 44 times [2018-12-03 16:40:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:39,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-03 16:40:41,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:41,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:41,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:41,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:41,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:41,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:41,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:41,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2018-12-03 16:40:41,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:41,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-03 16:40:41,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-03 16:40:43,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:43,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:40:43,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:43,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:40:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:40:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:40:43,480 INFO L87 Difference]: Start difference. First operand 4180 states and 4280 transitions. Second operand 54 states. [2018-12-03 16:40:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:56,045 INFO L93 Difference]: Finished difference Result 8364 states and 8565 transitions. [2018-12-03 16:40:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:40:56,046 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 308 [2018-12-03 16:40:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:56,057 INFO L225 Difference]: With dead ends: 8364 [2018-12-03 16:40:56,057 INFO L226 Difference]: Without dead ends: 4183 [2018-12-03 16:40:56,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 563 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:40:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4183 states. [2018-12-03 16:41:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 4183. [2018-12-03 16:41:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2018-12-03 16:41:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 4283 transitions. [2018-12-03 16:41:07,808 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 4283 transitions. Word has length 308 [2018-12-03 16:41:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:07,808 INFO L480 AbstractCegarLoop]: Abstraction has 4183 states and 4283 transitions. [2018-12-03 16:41:07,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:41:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 4283 transitions. [2018-12-03 16:41:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-03 16:41:07,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:07,810 INFO L402 BasicCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1] [2018-12-03 16:41:07,810 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1933735527, now seen corresponding path program 45 times [2018-12-03 16:41:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:07,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:07,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2018-12-03 16:41:09,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:09,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 16:41:09,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:41:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:41:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:41:09,098 INFO L87 Difference]: Start difference. First operand 4183 states and 4283 transitions. Second operand 53 states. [2018-12-03 16:41:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:09,456 INFO L93 Difference]: Finished difference Result 4183 states and 4283 transitions. [2018-12-03 16:41:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:41:09,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 311 [2018-12-03 16:41:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:09,457 INFO L225 Difference]: With dead ends: 4183 [2018-12-03 16:41:09,457 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:41:09,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:41:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:41:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:41:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:41:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:41:09,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 311 [2018-12-03 16:41:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:41:09,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:41:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:41:09,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:41:09,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:41:14,187 WARN L180 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 1498 DAG size of output: 1017 [2018-12-03 16:41:18,786 WARN L180 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 1617 DAG size of output: 922 [2018-12-03 16:41:22,063 WARN L180 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 1498 DAG size of output: 1017 [2018-12-03 16:41:30,169 WARN L180 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 968 DAG size of output: 509 [2018-12-03 16:41:39,456 WARN L180 SmtUtils]: Spent 9.28 s on a formula simplification. DAG size of input: 828 DAG size of output: 511 [2018-12-03 16:41:46,842 WARN L180 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 968 DAG size of output: 509 [2018-12-03 16:41:46,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 55) no Hoare annotation was computed. [2018-12-03 16:41:46,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 55) no Hoare annotation was computed. [2018-12-03 16:41:46,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 55) no Hoare annotation was computed. [2018-12-03 16:41:46,850 INFO L444 ceAbstractionStarter]: At program point L22(lines 22 31) the Hoare annotation is: (let ((.cse24 (<= ULTIMATE.start_main_~y~4 15)) (.cse25 (<= 15 ULTIMATE.start_main_~y~4)) (.cse18 (<= 12 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 12)) (.cse2 (<= 16 ULTIMATE.start_main_~y~4)) (.cse3 (<= ULTIMATE.start_main_~y~4 16)) (.cse34 (<= 20 ULTIMATE.start_main_~y~4)) (.cse35 (<= ULTIMATE.start_main_~y~4 20)) (.cse33 (<= ULTIMATE.start_main_~y~4 2)) (.cse32 (<= 2 ULTIMATE.start_main_~y~4)) (.cse59 (<= ULTIMATE.start_main_~y~4 13)) (.cse58 (<= 13 ULTIMATE.start_main_~y~4)) (.cse0 (<= 37 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 37)) (.cse38 (<= ULTIMATE.start_main_~y~4 26)) (.cse39 (<= 26 ULTIMATE.start_main_~y~4)) (.cse56 (<= ULTIMATE.start_main_~y~4 48)) (.cse57 (<= 48 ULTIMATE.start_main_~y~4)) (.cse67 (<= ULTIMATE.start_main_~y~4 33)) (.cse66 (<= 33 ULTIMATE.start_main_~y~4)) (.cse20 (<= ULTIMATE.start_main_~y~4 9)) (.cse21 (<= 9 ULTIMATE.start_main_~y~4)) (.cse52 (<= ULTIMATE.start_main_~y~4 0)) (.cse53 (<= 0 ULTIMATE.start_main_~y~4)) (.cse86 (<= ULTIMATE.start_main_~y~4 30)) (.cse87 (<= 30 ULTIMATE.start_main_~y~4)) (.cse72 (<= ULTIMATE.start_main_~y~4 22)) (.cse73 (<= 22 ULTIMATE.start_main_~y~4)) (.cse9 (<= 39 ULTIMATE.start_main_~y~4)) (.cse8 (<= ULTIMATE.start_main_~y~4 39)) (.cse30 (<= 25 ULTIMATE.start_main_~y~4)) (.cse31 (<= ULTIMATE.start_main_~y~4 25)) (.cse6 (<= ULTIMATE.start_main_~y~4 7)) (.cse7 (<= 7 ULTIMATE.start_main_~y~4)) (.cse45 (<= ULTIMATE.start_main_~y~4 45)) (.cse44 (<= 45 ULTIMATE.start_main_~y~4)) (.cse68 (<= ULTIMATE.start_main_~y~4 28)) (.cse69 (<= 28 ULTIMATE.start_main_~y~4)) (.cse82 (<= 4 ULTIMATE.start_main_~y~4)) (.cse83 (<= ULTIMATE.start_main_~y~4 4)) (.cse48 (<= 31 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 31)) (.cse15 (<= 23 ULTIMATE.start_main_~y~4)) (.cse14 (<= ULTIMATE.start_main_~y~4 23)) (.cse91 (<= 46 ULTIMATE.start_main_~y~4)) (.cse90 (<= ULTIMATE.start_main_~y~4 46)) (.cse40 (<= ULTIMATE.start_main_~y~4 3)) (.cse41 (<= 3 ULTIMATE.start_main_~y~4)) (.cse84 (<= ULTIMATE.start_main_~y~4 24)) (.cse85 (<= 24 ULTIMATE.start_main_~y~4)) (.cse62 (<= 41 ULTIMATE.start_main_~y~4)) (.cse63 (<= ULTIMATE.start_main_~y~4 41)) (.cse71 (<= 43 ULTIMATE.start_main_~y~4)) (.cse70 (<= ULTIMATE.start_main_~y~4 43)) (.cse81 (<= ULTIMATE.start_main_~y~4 35)) (.cse80 (<= 35 ULTIMATE.start_main_~y~4)) (.cse78 (<= 36 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 36)) (.cse28 (<= 34 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 34)) (.cse50 (<= 40 ULTIMATE.start_main_~y~4)) (.cse51 (<= ULTIMATE.start_main_~y~4 40)) (.cse74 (<= ULTIMATE.start_main_~y~4 1)) (.cse75 (<= 1 ULTIMATE.start_main_~y~4)) (.cse10 (<= 19 ULTIMATE.start_main_~y~4)) (.cse11 (<= ULTIMATE.start_main_~y~4 19)) (.cse26 (<= 8 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 8)) (.cse92 (<= 14 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 14)) (.cse23 (<= 11 ULTIMATE.start_main_~y~4)) (.cse22 (<= ULTIMATE.start_main_~y~4 11)) (.cse46 (<= ULTIMATE.start_main_~y~4 10)) (.cse47 (<= 10 ULTIMATE.start_main_~y~4)) (.cse95 (<= ULTIMATE.start_main_~y~4 42)) (.cse94 (<= 42 ULTIMATE.start_main_~y~4)) (.cse54 (<= 47 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 47)) (.cse4 (<= 17 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 17)) (.cse12 (<= ULTIMATE.start_main_~y~4 27)) (.cse13 (<= 27 ULTIMATE.start_main_~y~4)) (.cse99 (<= 49 ULTIMATE.start_main_~y~4)) (.cse98 (<= ULTIMATE.start_main_~y~4 49)) (.cse60 (<= 6 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 6)) (.cse36 (<= ULTIMATE.start_main_~y~4 38)) (.cse37 (<= 38 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 5)) (.cse76 (<= 5 ULTIMATE.start_main_~y~4)) (.cse97 (<= 32 ULTIMATE.start_main_~y~4)) (.cse96 (<= ULTIMATE.start_main_~y~4 32)) (.cse64 (<= 21 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 21)) (.cse88 (<= ULTIMATE.start_main_~y~4 44)) (.cse89 (<= 44 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 29)) (.cse17 (<= 29 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 18)) (.cse42 (<= 18 ULTIMATE.start_main_~y~4))) (or (and .cse0 (<= 63 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 16) .cse2 (<= 16 ULTIMATE.start_main_~x~4) .cse3) (and .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 7) .cse6 .cse7 (<= 7 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 39) .cse8 .cse9 (<= 39 ULTIMATE.start_main_~x~4)) (and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse10 .cse11) (and .cse12 .cse13 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and .cse14 .cse15 (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse16 .cse17) (and .cse18 (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse19) (and (<= ULTIMATE.start_main_~x~4 91) .cse20 .cse21 (<= 91 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse22 .cse23) (and .cse24 .cse25 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~x~4 8) .cse26 .cse27 (<= 8 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 34) .cse28 (<= 34 ULTIMATE.start_main_~x~4) .cse29) (and (<= ULTIMATE.start_main_~x~4 75) .cse30 (<= 75 ULTIMATE.start_main_~x~4) .cse31) (and .cse32 (<= ULTIMATE.start_main_~x~4 98) .cse33 (<= 98 ULTIMATE.start_main_~x~4)) (and .cse34 (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4) .cse35) (and (<= ULTIMATE.start_main_~x~4 62) .cse36 (<= 62 ULTIMATE.start_main_~x~4) .cse37) (and (<= 74 ULTIMATE.start_main_~x~4) .cse38 (<= ULTIMATE.start_main_~x~4 74) .cse39) (and .cse40 (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 97) .cse41) (and .cse24 (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15) .cse25) (and (<= 12 ULTIMATE.start_main_~x~4) .cse18 .cse19 (<= ULTIMATE.start_main_~x~4 12)) (and .cse42 (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse43) (and .cse44 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse45) (and (<= 10 ULTIMATE.start_main_~x~4) .cse46 (<= ULTIMATE.start_main_~x~4 10) .cse47) (and (<= 69 ULTIMATE.start_main_~x~4) .cse48 (<= ULTIMATE.start_main_~x~4 69) .cse49) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and .cse50 (<= 60 ULTIMATE.start_main_~x~4) .cse51 (<= ULTIMATE.start_main_~x~4 60)) (and .cse52 .cse53 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)) (and (<= 47 ULTIMATE.start_main_~x~4) .cse54 (<= ULTIMATE.start_main_~x~4 47) .cse55) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse56 .cse57) (and .cse2 (<= ULTIMATE.start_main_~x~4 84) .cse3 (<= 84 ULTIMATE.start_main_~x~4)) (and .cse58 .cse59 (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse60 .cse61 (<= ULTIMATE.start_main_~x~4 6)) (and (<= 41 ULTIMATE.start_main_~x~4) .cse62 (<= ULTIMATE.start_main_~x~4 41) .cse63) (and (<= 20 ULTIMATE.start_main_~x~4) .cse34 .cse35 (<= ULTIMATE.start_main_~x~4 20)) (and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79) .cse64 .cse65) (and (<= ULTIMATE.start_main_~x~4 33) .cse66 (<= 33 ULTIMATE.start_main_~x~4) .cse67) (and (<= 28 ULTIMATE.start_main_~x~4) .cse68 (<= ULTIMATE.start_main_~x~4 28) .cse69) (and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse70 .cse71) (and .cse33 .cse32 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and (<= 13 ULTIMATE.start_main_~x~4) .cse59 .cse58 (<= ULTIMATE.start_main_~x~4 13)) (and .cse0 (<= ULTIMATE.start_main_~x~4 37) .cse1 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse72 .cse73 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)) (and (<= 26 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 26) .cse38 .cse39) (and (<= ULTIMATE.start_main_~x~4 1) .cse74 .cse75 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 5) .cse76 .cse77 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse56 (<= ULTIMATE.start_main_~x~4 48) (<= 48 ULTIMATE.start_main_~x~4) .cse57) (and (<= 67 ULTIMATE.start_main_~x~4) .cse67 .cse66 (<= ULTIMATE.start_main_~x~4 67)) (and (<= ULTIMATE.start_main_~x~4 36) .cse78 (<= 36 ULTIMATE.start_main_~x~4) .cse79) (and .cse80 .cse81 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse20 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse21) (and .cse82 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse83) (and (<= ULTIMATE.start_main_~x~4 76) .cse84 .cse85 (<= 76 ULTIMATE.start_main_~x~4)) (and .cse86 .cse87 (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)) (and .cse52 .cse53 (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and .cse86 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse87) (and .cse72 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4) .cse73) (and (<= 61 ULTIMATE.start_main_~x~4) .cse9 (<= ULTIMATE.start_main_~x~4 61) .cse8) (and .cse30 .cse31 (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)) (and .cse6 .cse7 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and .cse45 (<= ULTIMATE.start_main_~x~4 45) .cse44 (<= 45 ULTIMATE.start_main_~x~4)) (and (<= 72 ULTIMATE.start_main_~x~4) .cse68 (<= ULTIMATE.start_main_~x~4 72) .cse69) (and .cse82 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4) .cse83) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse88 .cse89) (and (<= ULTIMATE.start_main_~x~4 31) .cse48 .cse49 (<= 31 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 54) .cse90 (<= 54 ULTIMATE.start_main_~x~4) .cse91) (and (<= ULTIMATE.start_main_~x~4 77) .cse15 (<= 77 ULTIMATE.start_main_~x~4) .cse14) (and (<= ULTIMATE.start_main_~x~4 46) .cse91 (<= 46 ULTIMATE.start_main_~x~4) .cse90) (and (<= 3 ULTIMATE.start_main_~x~4) .cse40 .cse41 (<= ULTIMATE.start_main_~x~4 3)) (and .cse84 .cse85 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)) (and .cse62 (<= ULTIMATE.start_main_~x~4 59) .cse63 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse71 .cse70) (and (<= 86 ULTIMATE.start_main_~x~4) .cse92 .cse93 (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 35) .cse81 .cse80 (<= 35 ULTIMATE.start_main_~x~4)) (and .cse78 (<= ULTIMATE.start_main_~x~4 64) .cse79 (<= 64 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) .cse28 (<= ULTIMATE.start_main_~x~4 66) .cse29) (and .cse94 (<= 58 ULTIMATE.start_main_~x~4) .cse95 (<= ULTIMATE.start_main_~x~4 58)) (and .cse50 (<= ULTIMATE.start_main_~x~4 40) .cse51 (<= 40 ULTIMATE.start_main_~x~4)) (and (<= 32 ULTIMATE.start_main_~x~4) .cse96 (<= ULTIMATE.start_main_~x~4 32) .cse97) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse74 .cse75) (and .cse10 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse11) (and (<= 51 ULTIMATE.start_main_~x~4) .cse98 (<= ULTIMATE.start_main_~x~4 51) .cse99) (and (<= ULTIMATE.start_main_~x~4 92) .cse26 .cse27 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse92 (<= 14 ULTIMATE.start_main_~x~4) .cse93 (<= ULTIMATE.start_main_~x~4 14)) (and .cse23 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse22) (and .cse46 (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4) .cse47) (and .cse95 .cse94 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)) (and .cse54 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse55) (and (<= 83 ULTIMATE.start_main_~x~4) .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 83)) (and .cse12 (<= ULTIMATE.start_main_~x~4 27) .cse13 (<= 27 ULTIMATE.start_main_~x~4)) (and (<= 49 ULTIMATE.start_main_~x~4) .cse99 .cse98 (<= ULTIMATE.start_main_~x~4 49)) (and .cse60 .cse61 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38) .cse36 .cse37) (and .cse77 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse76) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse97 .cse96) (and (<= 21 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 21) .cse64 .cse65) (and (<= ULTIMATE.start_main_~x~4 44) (<= 44 ULTIMATE.start_main_~x~4) .cse88 .cse89) (and (<= 29 ULTIMATE.start_main_~x~4) .cse16 .cse17 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse43 .cse42))) [2018-12-03 16:41:46,853 INFO L444 ceAbstractionStarter]: At program point L52(lines 18 52) the Hoare annotation is: (let ((.cse24 (<= ULTIMATE.start_main_~y~4 15)) (.cse25 (<= 15 ULTIMATE.start_main_~y~4)) (.cse18 (<= 12 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 12)) (.cse2 (<= 16 ULTIMATE.start_main_~y~4)) (.cse3 (<= ULTIMATE.start_main_~y~4 16)) (.cse34 (<= 20 ULTIMATE.start_main_~y~4)) (.cse35 (<= ULTIMATE.start_main_~y~4 20)) (.cse33 (<= ULTIMATE.start_main_~y~4 2)) (.cse32 (<= 2 ULTIMATE.start_main_~y~4)) (.cse59 (<= ULTIMATE.start_main_~y~4 13)) (.cse58 (<= 13 ULTIMATE.start_main_~y~4)) (.cse0 (<= 37 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 37)) (.cse38 (<= ULTIMATE.start_main_~y~4 26)) (.cse39 (<= 26 ULTIMATE.start_main_~y~4)) (.cse56 (<= ULTIMATE.start_main_~y~4 48)) (.cse57 (<= 48 ULTIMATE.start_main_~y~4)) (.cse67 (<= ULTIMATE.start_main_~y~4 33)) (.cse66 (<= 33 ULTIMATE.start_main_~y~4)) (.cse20 (<= ULTIMATE.start_main_~y~4 9)) (.cse21 (<= 9 ULTIMATE.start_main_~y~4)) (.cse52 (<= ULTIMATE.start_main_~y~4 0)) (.cse53 (<= 0 ULTIMATE.start_main_~y~4)) (.cse86 (<= ULTIMATE.start_main_~y~4 30)) (.cse87 (<= 30 ULTIMATE.start_main_~y~4)) (.cse72 (<= ULTIMATE.start_main_~y~4 22)) (.cse73 (<= 22 ULTIMATE.start_main_~y~4)) (.cse9 (<= 39 ULTIMATE.start_main_~y~4)) (.cse8 (<= ULTIMATE.start_main_~y~4 39)) (.cse30 (<= 25 ULTIMATE.start_main_~y~4)) (.cse31 (<= ULTIMATE.start_main_~y~4 25)) (.cse6 (<= ULTIMATE.start_main_~y~4 7)) (.cse7 (<= 7 ULTIMATE.start_main_~y~4)) (.cse45 (<= ULTIMATE.start_main_~y~4 45)) (.cse44 (<= 45 ULTIMATE.start_main_~y~4)) (.cse68 (<= ULTIMATE.start_main_~y~4 28)) (.cse69 (<= 28 ULTIMATE.start_main_~y~4)) (.cse82 (<= 4 ULTIMATE.start_main_~y~4)) (.cse83 (<= ULTIMATE.start_main_~y~4 4)) (.cse48 (<= 31 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 31)) (.cse15 (<= 23 ULTIMATE.start_main_~y~4)) (.cse14 (<= ULTIMATE.start_main_~y~4 23)) (.cse91 (<= 46 ULTIMATE.start_main_~y~4)) (.cse90 (<= ULTIMATE.start_main_~y~4 46)) (.cse40 (<= ULTIMATE.start_main_~y~4 3)) (.cse41 (<= 3 ULTIMATE.start_main_~y~4)) (.cse84 (<= ULTIMATE.start_main_~y~4 24)) (.cse85 (<= 24 ULTIMATE.start_main_~y~4)) (.cse62 (<= 41 ULTIMATE.start_main_~y~4)) (.cse63 (<= ULTIMATE.start_main_~y~4 41)) (.cse71 (<= 43 ULTIMATE.start_main_~y~4)) (.cse70 (<= ULTIMATE.start_main_~y~4 43)) (.cse81 (<= ULTIMATE.start_main_~y~4 35)) (.cse80 (<= 35 ULTIMATE.start_main_~y~4)) (.cse78 (<= 36 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 36)) (.cse28 (<= 34 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 34)) (.cse50 (<= 40 ULTIMATE.start_main_~y~4)) (.cse51 (<= ULTIMATE.start_main_~y~4 40)) (.cse74 (<= ULTIMATE.start_main_~y~4 1)) (.cse75 (<= 1 ULTIMATE.start_main_~y~4)) (.cse10 (<= 19 ULTIMATE.start_main_~y~4)) (.cse11 (<= ULTIMATE.start_main_~y~4 19)) (.cse26 (<= 8 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 8)) (.cse92 (<= 14 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 14)) (.cse23 (<= 11 ULTIMATE.start_main_~y~4)) (.cse22 (<= ULTIMATE.start_main_~y~4 11)) (.cse46 (<= ULTIMATE.start_main_~y~4 10)) (.cse47 (<= 10 ULTIMATE.start_main_~y~4)) (.cse95 (<= ULTIMATE.start_main_~y~4 42)) (.cse94 (<= 42 ULTIMATE.start_main_~y~4)) (.cse54 (<= 47 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 47)) (.cse4 (<= 17 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 17)) (.cse12 (<= ULTIMATE.start_main_~y~4 27)) (.cse13 (<= 27 ULTIMATE.start_main_~y~4)) (.cse99 (<= 49 ULTIMATE.start_main_~y~4)) (.cse98 (<= ULTIMATE.start_main_~y~4 49)) (.cse60 (<= 6 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 6)) (.cse36 (<= ULTIMATE.start_main_~y~4 38)) (.cse37 (<= 38 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 5)) (.cse76 (<= 5 ULTIMATE.start_main_~y~4)) (.cse97 (<= 32 ULTIMATE.start_main_~y~4)) (.cse96 (<= ULTIMATE.start_main_~y~4 32)) (.cse64 (<= 21 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 21)) (.cse88 (<= ULTIMATE.start_main_~y~4 44)) (.cse89 (<= 44 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 29)) (.cse17 (<= 29 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 18)) (.cse42 (<= 18 ULTIMATE.start_main_~y~4))) (or (and .cse0 (<= 63 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 16) .cse2 (<= 16 ULTIMATE.start_main_~x~4) .cse3) (and .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 7) .cse6 .cse7 (<= 7 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 39) .cse8 .cse9 (<= 39 ULTIMATE.start_main_~x~4)) (and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse10 .cse11) (and .cse12 .cse13 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and .cse14 .cse15 (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse16 .cse17) (and .cse18 (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse19) (and (<= ULTIMATE.start_main_~x~4 91) .cse20 .cse21 (<= 91 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse22 .cse23) (and .cse24 .cse25 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~x~4 8) .cse26 .cse27 (<= 8 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 34) .cse28 (<= 34 ULTIMATE.start_main_~x~4) .cse29) (and (<= ULTIMATE.start_main_~x~4 75) .cse30 (<= 75 ULTIMATE.start_main_~x~4) .cse31) (and .cse32 (<= ULTIMATE.start_main_~x~4 98) .cse33 (<= 98 ULTIMATE.start_main_~x~4)) (and .cse34 (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4) .cse35) (and (<= ULTIMATE.start_main_~x~4 62) .cse36 (<= 62 ULTIMATE.start_main_~x~4) .cse37) (and (<= 74 ULTIMATE.start_main_~x~4) .cse38 (<= ULTIMATE.start_main_~x~4 74) .cse39) (and .cse40 (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 97) .cse41) (and .cse24 (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15) .cse25) (and (<= 12 ULTIMATE.start_main_~x~4) .cse18 .cse19 (<= ULTIMATE.start_main_~x~4 12)) (and .cse42 (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse43) (and .cse44 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse45) (and (<= 10 ULTIMATE.start_main_~x~4) .cse46 (<= ULTIMATE.start_main_~x~4 10) .cse47) (and (<= 69 ULTIMATE.start_main_~x~4) .cse48 (<= ULTIMATE.start_main_~x~4 69) .cse49) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and .cse50 (<= 60 ULTIMATE.start_main_~x~4) .cse51 (<= ULTIMATE.start_main_~x~4 60)) (and .cse52 .cse53 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)) (and (<= 47 ULTIMATE.start_main_~x~4) .cse54 (<= ULTIMATE.start_main_~x~4 47) .cse55) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse56 .cse57) (and .cse2 (<= ULTIMATE.start_main_~x~4 84) .cse3 (<= 84 ULTIMATE.start_main_~x~4)) (and .cse58 .cse59 (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse60 .cse61 (<= ULTIMATE.start_main_~x~4 6)) (and (<= 41 ULTIMATE.start_main_~x~4) .cse62 (<= ULTIMATE.start_main_~x~4 41) .cse63) (and (<= 20 ULTIMATE.start_main_~x~4) .cse34 .cse35 (<= ULTIMATE.start_main_~x~4 20)) (and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79) .cse64 .cse65) (and (<= ULTIMATE.start_main_~x~4 33) .cse66 (<= 33 ULTIMATE.start_main_~x~4) .cse67) (and (<= 28 ULTIMATE.start_main_~x~4) .cse68 (<= ULTIMATE.start_main_~x~4 28) .cse69) (and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse70 .cse71) (and .cse33 .cse32 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and (<= 13 ULTIMATE.start_main_~x~4) .cse59 .cse58 (<= ULTIMATE.start_main_~x~4 13)) (and .cse0 (<= ULTIMATE.start_main_~x~4 37) .cse1 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse72 .cse73 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)) (and (<= 26 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 26) .cse38 .cse39) (and (<= ULTIMATE.start_main_~x~4 1) .cse74 .cse75 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 5) .cse76 .cse77 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse56 (<= ULTIMATE.start_main_~x~4 48) (<= 48 ULTIMATE.start_main_~x~4) .cse57) (and (<= 67 ULTIMATE.start_main_~x~4) .cse67 .cse66 (<= ULTIMATE.start_main_~x~4 67)) (and (<= ULTIMATE.start_main_~x~4 36) .cse78 (<= 36 ULTIMATE.start_main_~x~4) .cse79) (and .cse80 .cse81 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse20 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse21) (and .cse82 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse83) (and (<= ULTIMATE.start_main_~x~4 76) .cse84 .cse85 (<= 76 ULTIMATE.start_main_~x~4)) (and .cse86 .cse87 (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)) (and .cse52 .cse53 (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and .cse86 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse87) (and .cse72 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4) .cse73) (and (<= 61 ULTIMATE.start_main_~x~4) .cse9 (<= ULTIMATE.start_main_~x~4 61) .cse8) (and .cse30 .cse31 (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)) (and .cse6 .cse7 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and .cse45 (<= ULTIMATE.start_main_~x~4 45) .cse44 (<= 45 ULTIMATE.start_main_~x~4)) (and (<= 72 ULTIMATE.start_main_~x~4) .cse68 (<= ULTIMATE.start_main_~x~4 72) .cse69) (and .cse82 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4) .cse83) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse88 .cse89) (and (<= ULTIMATE.start_main_~x~4 31) .cse48 .cse49 (<= 31 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 54) .cse90 (<= 54 ULTIMATE.start_main_~x~4) .cse91) (and (<= ULTIMATE.start_main_~x~4 77) .cse15 (<= 77 ULTIMATE.start_main_~x~4) .cse14) (and (<= ULTIMATE.start_main_~x~4 46) .cse91 (<= 46 ULTIMATE.start_main_~x~4) .cse90) (and (<= 3 ULTIMATE.start_main_~x~4) .cse40 .cse41 (<= ULTIMATE.start_main_~x~4 3)) (and .cse84 .cse85 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)) (and .cse62 (<= ULTIMATE.start_main_~x~4 59) .cse63 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse71 .cse70) (and (<= 86 ULTIMATE.start_main_~x~4) .cse92 .cse93 (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 35) .cse81 .cse80 (<= 35 ULTIMATE.start_main_~x~4)) (and .cse78 (<= ULTIMATE.start_main_~x~4 64) .cse79 (<= 64 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) .cse28 (<= ULTIMATE.start_main_~x~4 66) .cse29) (and .cse94 (<= 58 ULTIMATE.start_main_~x~4) .cse95 (<= ULTIMATE.start_main_~x~4 58)) (and .cse50 (<= ULTIMATE.start_main_~x~4 40) .cse51 (<= 40 ULTIMATE.start_main_~x~4)) (and (<= 32 ULTIMATE.start_main_~x~4) .cse96 (<= ULTIMATE.start_main_~x~4 32) .cse97) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse74 .cse75) (and .cse10 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse11) (and (<= 51 ULTIMATE.start_main_~x~4) .cse98 (<= ULTIMATE.start_main_~x~4 51) .cse99) (and (<= ULTIMATE.start_main_~x~4 92) .cse26 .cse27 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse92 (<= 14 ULTIMATE.start_main_~x~4) .cse93 (<= ULTIMATE.start_main_~x~4 14)) (and .cse23 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse22) (and .cse46 (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4) .cse47) (and .cse95 .cse94 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)) (and .cse54 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse55) (and (<= 83 ULTIMATE.start_main_~x~4) .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 83)) (and .cse12 (<= ULTIMATE.start_main_~x~4 27) .cse13 (<= 27 ULTIMATE.start_main_~x~4)) (and (<= 49 ULTIMATE.start_main_~x~4) .cse99 .cse98 (<= ULTIMATE.start_main_~x~4 49)) (and .cse60 .cse61 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38) .cse36 .cse37) (and .cse77 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse76) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse97 .cse96) (and (<= 21 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 21) .cse64 .cse65) (and (<= ULTIMATE.start_main_~x~4 44) (<= 44 ULTIMATE.start_main_~x~4) .cse88 .cse89) (and (<= 29 ULTIMATE.start_main_~x~4) .cse16 .cse17 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse43 .cse42))) [2018-12-03 16:41:46,853 INFO L444 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: false [2018-12-03 16:41:46,854 INFO L444 ceAbstractionStarter]: At program point L36(lines 30 47) the Hoare annotation is: (let ((.cse12 (<= ULTIMATE.start_main_~y~4 38)) (.cse13 (<= 38 ULTIMATE.start_main_~y~4)) (.cse44 (<= ULTIMATE.start_main_~y~4 9)) (.cse45 (<= 9 ULTIMATE.start_main_~y~4)) (.cse32 (<= 5 ULTIMATE.start_main_~y~4)) (.cse33 (<= ULTIMATE.start_main_~y~4 5)) (.cse47 (<= ULTIMATE.start_main_~y~4 43)) (.cse46 (<= 43 ULTIMATE.start_main_~y~4)) (.cse18 (<= ULTIMATE.start_main_~y~4 10)) (.cse19 (<= 10 ULTIMATE.start_main_~y~4)) (.cse16 (<= 45 ULTIMATE.start_main_~y~4)) (.cse17 (<= ULTIMATE.start_main_~y~4 45)) (.cse34 (<= 35 ULTIMATE.start_main_~y~4)) (.cse35 (<= ULTIMATE.start_main_~y~4 35)) (.cse60 (<= 37 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 37)) (.cse23 (<= ULTIMATE.start_main_~y~4 47)) (.cse22 (<= 47 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 46)) (.cse64 (<= 46 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 25)) (.cse38 (<= 25 ULTIMATE.start_main_~y~4)) (.cse27 (<= 39 ULTIMATE.start_main_~y~4)) (.cse26 (<= ULTIMATE.start_main_~y~4 39)) (.cse8 (<= ULTIMATE.start_main_~y~4 7)) (.cse9 (<= 7 ULTIMATE.start_main_~y~4)) (.cse40 (<= ULTIMATE.start_main_~y~4 41)) (.cse41 (<= 41 ULTIMATE.start_main_~y~4)) (.cse49 (<= 40 ULTIMATE.start_main_~y~4)) (.cse48 (<= ULTIMATE.start_main_~y~4 40)) (.cse66 (<= 12 ULTIMATE.start_main_~y~4)) (.cse67 (<= ULTIMATE.start_main_~y~4 12)) (.cse28 (<= ULTIMATE.start_main_~y~4 42)) (.cse29 (<= 42 ULTIMATE.start_main_~y~4)) (.cse42 (<= ULTIMATE.start_main_~y~4 27)) (.cse43 (<= 27 ULTIMATE.start_main_~y~4)) (.cse52 (<= 4 ULTIMATE.start_main_~y~4)) (.cse53 (<= ULTIMATE.start_main_~y~4 4)) (.cse74 (<= ULTIMATE.start_main_~y~4 2)) (.cse75 (<= 2 ULTIMATE.start_main_~y~4)) (.cse76 (<= 31 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 31)) (.cse30 (<= 19 ULTIMATE.start_main_~y~4)) (.cse31 (<= ULTIMATE.start_main_~y~4 19)) (.cse3 (<= 34 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 34)) (.cse14 (<= ULTIMATE.start_main_~y~4 44)) (.cse15 (<= 44 ULTIMATE.start_main_~y~4)) (.cse68 (<= ULTIMATE.start_main_~y~4 13)) (.cse69 (<= 13 ULTIMATE.start_main_~y~4)) (.cse6 (<= ULTIMATE.start_main_~y~4 22)) (.cse7 (<= 22 ULTIMATE.start_main_~y~4)) (.cse72 (<= 14 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 14)) (.cse94 (<= ULTIMATE.start_main_~y~4 1)) (.cse95 (<= 1 ULTIMATE.start_main_~y~4)) (.cse36 (<= ULTIMATE.start_main_~y~4 23)) (.cse37 (<= 23 ULTIMATE.start_main_~y~4)) (.cse89 (<= 49 ULTIMATE.start_main_~y~4)) (.cse88 (<= ULTIMATE.start_main_~y~4 49)) (.cse78 (<= 21 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 21)) (.cse56 (<= ULTIMATE.start_main_~y~4 15)) (.cse57 (<= 15 ULTIMATE.start_main_~y~4)) (.cse0 (<= 16 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 16)) (.cse4 (<= ULTIMATE.start_main_~y~4 26)) (.cse5 (<= 26 ULTIMATE.start_main_~y~4)) (.cse83 (<= ULTIMATE.start_main_~y~4 48)) (.cse82 (<= 48 ULTIMATE.start_main_~y~4)) (.cse54 (<= 24 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 24)) (.cse20 (<= 20 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 20)) (.cse10 (<= 18 ULTIMATE.start_main_~y~4)) (.cse11 (<= ULTIMATE.start_main_~y~4 18)) (.cse50 (<= ULTIMATE.start_main_~y~4 30)) (.cse51 (<= 30 ULTIMATE.start_main_~y~4)) (.cse58 (<= ULTIMATE.start_main_~y~4 29)) (.cse59 (<= 29 ULTIMATE.start_main_~y~4)) (.cse62 (<= 33 ULTIMATE.start_main_~y~4)) (.cse63 (<= ULTIMATE.start_main_~y~4 33)) (.cse70 (<= ULTIMATE.start_main_~y~4 3)) (.cse71 (<= 3 ULTIMATE.start_main_~y~4)) (.cse92 (<= 6 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 6)) (.cse24 (<= 17 ULTIMATE.start_main_~y~4)) (.cse25 (<= ULTIMATE.start_main_~y~4 17)) (.cse96 (<= 8 ULTIMATE.start_main_~y~4)) (.cse97 (<= ULTIMATE.start_main_~y~4 8)) (.cse91 (<= 36 ULTIMATE.start_main_~y~4)) (.cse90 (<= ULTIMATE.start_main_~y~4 36)) (.cse86 (<= ULTIMATE.start_main_~y~4 28)) (.cse87 (<= 28 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 11)) (.cse84 (<= 11 ULTIMATE.start_main_~y~4)) (.cse80 (<= 32 ULTIMATE.start_main_~y~4)) (.cse81 (<= ULTIMATE.start_main_~y~4 32))) (or (and (<= 15 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 15) .cse1) (and (<= ULTIMATE.start_main_~y~4 50) (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) (<= 50 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4) .cse2 .cse3) (and .cse4 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4) .cse5) (and (<= ULTIMATE.start_main_~x~4 21) .cse6 (<= 21 ULTIMATE.start_main_~x~4) .cse7) (and .cse8 (<= 6 ULTIMATE.start_main_~x~4) .cse9 (<= ULTIMATE.start_main_~x~4 6)) (and .cse10 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse11) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) .cse12 .cse13) (and (<= ULTIMATE.start_main_~x~4 43) .cse14 .cse15 (<= 43 ULTIMATE.start_main_~x~4)) (and .cse16 (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4) .cse17) (and .cse18 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse19) (and (<= 79 ULTIMATE.start_main_~x~4) .cse20 (<= ULTIMATE.start_main_~x~4 79) .cse21) (and (<= ULTIMATE.start_main_~x~4 46) .cse22 (<= 46 ULTIMATE.start_main_~x~4) .cse23) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse24 .cse25) (and .cse26 (<= 60 ULTIMATE.start_main_~x~4) .cse27 (<= ULTIMATE.start_main_~x~4 60)) (and .cse28 .cse29 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and .cse30 (<= ULTIMATE.start_main_~x~4 80) .cse31 (<= 80 ULTIMATE.start_main_~x~4)) (and .cse32 .cse33 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse34 .cse35) (and .cse36 .cse37 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 37) .cse12 .cse13 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse38 (<= ULTIMATE.start_main_~x~4 24) .cse39 (<= 24 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 40) .cse40 (<= 40 ULTIMATE.start_main_~x~4) .cse41) (and .cse42 (<= 72 ULTIMATE.start_main_~x~4) .cse43 (<= ULTIMATE.start_main_~x~4 72)) (and (<= ULTIMATE.start_main_~x~4 90) .cse44 (<= 90 ULTIMATE.start_main_~x~4) .cse45) (and .cse44 (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4) .cse45) (and .cse46 (<= ULTIMATE.start_main_~x~4 42) .cse47 (<= 42 ULTIMATE.start_main_~x~4)) (and .cse32 .cse33 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 39) .cse48 (<= 39 ULTIMATE.start_main_~x~4) .cse49) (and (<= ULTIMATE.start_main_~y~4 0) (<= 0 ULTIMATE.start_main_~y~4) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and .cse50 (<= 29 ULTIMATE.start_main_~x~4) .cse51 (<= ULTIMATE.start_main_~x~4 29)) (and .cse52 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse53) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse54 .cse55) (and .cse56 (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4) .cse57) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse47 .cse46) (and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse58 .cse59) (and (<= 36 ULTIMATE.start_main_~x~4) .cse60 .cse61 (<= ULTIMATE.start_main_~x~4 36)) (and (<= ULTIMATE.start_main_~x~4 32) .cse62 (<= 32 ULTIMATE.start_main_~x~4) .cse63) (and .cse18 (<= 9 ULTIMATE.start_main_~x~4) .cse19 (<= ULTIMATE.start_main_~x~4 9)) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse16 .cse17) (and .cse34 (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) .cse35) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse64 .cse65) (and .cse66 (<= ULTIMATE.start_main_~x~4 87) .cse67 (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) .cse60 .cse61 (<= 62 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse23 .cse22) (and .cse65 .cse64 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= 74 ULTIMATE.start_main_~x~4) .cse39 .cse38 (<= ULTIMATE.start_main_~x~4 74)) (and .cse68 .cse69 (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse27 (<= ULTIMATE.start_main_~x~4 38) .cse26) (and .cse70 .cse71 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and .cse72 .cse73 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and .cse74 (<= 97 ULTIMATE.start_main_~x~4) .cse75 (<= ULTIMATE.start_main_~x~4 97)) (and (<= ULTIMATE.start_main_~x~4 30) .cse76 (<= 30 ULTIMATE.start_main_~x~4) .cse77) (and .cse8 (<= ULTIMATE.start_main_~x~4 92) .cse9 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse40 .cse41 (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)) (and (<= 20 ULTIMATE.start_main_~x~4) .cse78 (<= ULTIMATE.start_main_~x~4 20) .cse79) (and (<= ULTIMATE.start_main_~x~4 59) .cse49 .cse48 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 31) .cse80 (<= 31 ULTIMATE.start_main_~x~4) .cse81) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse66 .cse67) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and .cse42 (<= ULTIMATE.start_main_~x~4 26) .cse43 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 3 ULTIMATE.start_main_~x~4) .cse52 (<= ULTIMATE.start_main_~x~4 3) .cse53) (and .cse82 (<= 47 ULTIMATE.start_main_~x~4) .cse83 (<= ULTIMATE.start_main_~x~4 47)) (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse84 .cse85) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse86 .cse87) (and .cse74 .cse75 (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4) .cse88 .cse89) (and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse90 .cse91) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse76 .cse77) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse30 .cse31) (and .cse3 .cse2 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse14 .cse15 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)) (and (<= (+ ULTIMATE.start_main_~y~4 1) 0) (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 12 ULTIMATE.start_main_~x~4) .cse68 .cse69 (<= ULTIMATE.start_main_~x~4 12)) (and (<= ULTIMATE.start_main_~x~4 77) .cse6 (<= 77 ULTIMATE.start_main_~x~4) .cse7) (and .cse72 (<= 13 ULTIMATE.start_main_~x~4) .cse73 (<= ULTIMATE.start_main_~x~4 13)) (and .cse92 .cse93 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse94 .cse95) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) .cse94 .cse95) (and (<= ULTIMATE.start_main_~x~4 76) .cse36 .cse37 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 48 ULTIMATE.start_main_~x~4) .cse89 .cse88 (<= ULTIMATE.start_main_~x~4 48)) (and (<= ULTIMATE.start_main_~x~4 78) .cse78 (<= 78 ULTIMATE.start_main_~x~4) .cse79) (and .cse56 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse57) (and (<= 83 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 83)) (and .cse4 (<= ULTIMATE.start_main_~x~4 25) .cse5 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse83 .cse82 (<= ULTIMATE.start_main_~x~4 51)) (and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse54 .cse55) (and .cse20 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse21) (and .cse10 (<= ULTIMATE.start_main_~x~4 17) .cse11 (<= 17 ULTIMATE.start_main_~x~4)) (and .cse50 .cse51 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)) (and (<= ULTIMATE.start_main_~x~4 28) .cse58 .cse59 (<= 28 ULTIMATE.start_main_~x~4)) (and .cse62 (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66) .cse63) (and (<= ULTIMATE.start_main_~x~4 91) .cse96 (<= 91 ULTIMATE.start_main_~x~4) .cse97) (and .cse70 .cse71 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 5) .cse92 .cse93 (<= 5 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 16) .cse24 .cse25 (<= 16 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4) .cse96 .cse97) (and (<= 63 ULTIMATE.start_main_~x~4) .cse91 .cse90 (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 27) .cse86 (<= 27 ULTIMATE.start_main_~x~4) .cse87) (and (<= ULTIMATE.start_main_~x~4 10) .cse85 .cse84 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 67 ULTIMATE.start_main_~x~4) .cse80 .cse81 (<= ULTIMATE.start_main_~x~4 67)))) [2018-12-03 16:41:46,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 54) no Hoare annotation was computed. [2018-12-03 16:41:46,918 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:41:46 BoogieIcfgContainer [2018-12-03 16:41:46,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:41:46,919 INFO L168 Benchmark]: Toolchain (without parser) took 187388.79 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -652.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-12-03 16:41:46,920 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:41:46,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:41:46,921 INFO L168 Benchmark]: Boogie Preprocessor took 26.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:41:46,921 INFO L168 Benchmark]: RCFGBuilder took 266.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:41:46,922 INFO L168 Benchmark]: TraceAbstraction took 187049.91 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -673.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-12-03 16:41:46,929 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 266.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187049.91 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -673.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((37 <= main_~y~4 && 63 <= main_~x~4) && main_~y~4 <= 37) && main_~x~4 <= 63) || (((main_~x~4 <= 16 && 16 <= main_~y~4) && 16 <= main_~x~4) && main_~y~4 <= 16)) || (((17 <= main_~y~4 && main_~y~4 <= 17) && main_~x~4 <= 17) && 17 <= main_~x~4)) || (((main_~x~4 <= 7 && main_~y~4 <= 7) && 7 <= main_~y~4) && 7 <= main_~x~4)) || (((main_~x~4 <= 39 && main_~y~4 <= 39) && 39 <= main_~y~4) && 39 <= main_~x~4)) || (((19 <= main_~x~4 && main_~x~4 <= 19) && 19 <= main_~y~4) && main_~y~4 <= 19)) || (((main_~y~4 <= 27 && 27 <= main_~y~4) && main_~x~4 <= 73) && 73 <= main_~x~4)) || (((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 <= 23) && 23 <= main_~x~4)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((12 <= main_~y~4 && 88 <= main_~x~4) && main_~x~4 <= 88) && main_~y~4 <= 12)) || (((main_~x~4 <= 91 && main_~y~4 <= 9) && 9 <= main_~y~4) && 91 <= main_~x~4)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((main_~y~4 <= 15 && 15 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~x~4 <= 8 && 8 <= main_~y~4) && main_~y~4 <= 8) && 8 <= main_~x~4)) || (((main_~x~4 <= 34 && 34 <= main_~y~4) && 34 <= main_~x~4) && main_~y~4 <= 34)) || (((main_~x~4 <= 75 && 25 <= main_~y~4) && 75 <= main_~x~4) && main_~y~4 <= 25)) || (((2 <= main_~y~4 && main_~x~4 <= 98) && main_~y~4 <= 2) && 98 <= main_~x~4)) || (((20 <= main_~y~4 && main_~x~4 <= 80) && 80 <= main_~x~4) && main_~y~4 <= 20)) || (((main_~x~4 <= 62 && main_~y~4 <= 38) && 62 <= main_~x~4) && 38 <= main_~y~4)) || (((74 <= main_~x~4 && main_~y~4 <= 26) && main_~x~4 <= 74) && 26 <= main_~y~4)) || (((main_~y~4 <= 3 && 97 <= main_~x~4) && main_~x~4 <= 97) && 3 <= main_~y~4)) || (((main_~y~4 <= 15 && 15 <= main_~x~4) && main_~x~4 <= 15) && 15 <= main_~y~4)) || (((12 <= main_~x~4 && 12 <= main_~y~4) && main_~y~4 <= 12) && main_~x~4 <= 12)) || (((18 <= main_~y~4 && 18 <= main_~x~4) && main_~x~4 <= 18) && main_~y~4 <= 18)) || (((45 <= main_~y~4 && 55 <= main_~x~4) && main_~x~4 <= 55) && main_~y~4 <= 45)) || (((10 <= main_~x~4 && main_~y~4 <= 10) && main_~x~4 <= 10) && 10 <= main_~y~4)) || (((69 <= main_~x~4 && 31 <= main_~y~4) && main_~x~4 <= 69) && main_~y~4 <= 31)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((40 <= main_~y~4 && 60 <= main_~x~4) && main_~y~4 <= 40) && main_~x~4 <= 60)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 0) && 0 <= main_~x~4)) || (((47 <= main_~x~4 && 47 <= main_~y~4) && main_~x~4 <= 47) && main_~y~4 <= 47)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && main_~y~4 <= 48) && 48 <= main_~y~4)) || (((16 <= main_~y~4 && main_~x~4 <= 84) && main_~y~4 <= 16) && 84 <= main_~x~4)) || (((13 <= main_~y~4 && main_~y~4 <= 13) && main_~x~4 <= 87) && 87 <= main_~x~4)) || (((6 <= main_~x~4 && 6 <= main_~y~4) && main_~y~4 <= 6) && main_~x~4 <= 6)) || (((41 <= main_~x~4 && 41 <= main_~y~4) && main_~x~4 <= 41) && main_~y~4 <= 41)) || (((20 <= main_~x~4 && 20 <= main_~y~4) && main_~y~4 <= 20) && main_~x~4 <= 20)) || (((79 <= main_~x~4 && main_~x~4 <= 79) && 21 <= main_~y~4) && main_~y~4 <= 21)) || (((main_~x~4 <= 33 && 33 <= main_~y~4) && 33 <= main_~x~4) && main_~y~4 <= 33)) || (((28 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 28) && 28 <= main_~y~4)) || (((57 <= main_~x~4 && main_~x~4 <= 57) && main_~y~4 <= 43) && 43 <= main_~y~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((13 <= main_~x~4 && main_~y~4 <= 13) && 13 <= main_~y~4) && main_~x~4 <= 13)) || (((37 <= main_~y~4 && main_~x~4 <= 37) && main_~y~4 <= 37) && 37 <= main_~x~4)) || (((main_~y~4 <= 22 && 22 <= main_~y~4) && main_~x~4 <= 78) && 78 <= main_~x~4)) || (((26 <= main_~x~4 && main_~x~4 <= 26) && main_~y~4 <= 26) && 26 <= main_~y~4)) || (((main_~x~4 <= 1 && main_~y~4 <= 1) && 1 <= main_~y~4) && 1 <= main_~x~4)) || (((main_~x~4 <= 5 && 5 <= main_~y~4) && main_~y~4 <= 5) && 5 <= main_~x~4)) || (((main_~y~4 <= 48 && main_~x~4 <= 48) && 48 <= main_~x~4) && 48 <= main_~y~4)) || (((67 <= main_~x~4 && main_~y~4 <= 33) && 33 <= main_~y~4) && main_~x~4 <= 67)) || (((main_~x~4 <= 36 && 36 <= main_~y~4) && 36 <= main_~x~4) && main_~y~4 <= 36)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~y~4 <= 9 && 9 <= main_~x~4) && main_~x~4 <= 9) && 9 <= main_~y~4)) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 76 && main_~y~4 <= 24) && 24 <= main_~y~4) && 76 <= main_~x~4)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && main_~x~4 <= 30) && 30 <= main_~x~4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 70 <= main_~x~4) && 30 <= main_~y~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 22) && 22 <= main_~x~4) && 22 <= main_~y~4)) || (((61 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 39)) || (((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 <= 25) && 25 <= main_~x~4)) || (((main_~y~4 <= 7 && 7 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~y~4 <= 45 && main_~x~4 <= 45) && 45 <= main_~y~4) && 45 <= main_~x~4)) || (((72 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 72) && 28 <= main_~y~4)) || (((4 <= main_~y~4 && main_~x~4 <= 4) && 4 <= main_~x~4) && main_~y~4 <= 4)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((main_~x~4 <= 31 && 31 <= main_~y~4) && main_~y~4 <= 31) && 31 <= main_~x~4)) || (((main_~x~4 <= 54 && main_~y~4 <= 46) && 54 <= main_~x~4) && 46 <= main_~y~4)) || (((main_~x~4 <= 77 && 23 <= main_~y~4) && 77 <= main_~x~4) && main_~y~4 <= 23)) || (((main_~x~4 <= 46 && 46 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 46)) || (((3 <= main_~x~4 && main_~y~4 <= 3) && 3 <= main_~y~4) && main_~x~4 <= 3)) || (((main_~y~4 <= 24 && 24 <= main_~y~4) && main_~x~4 <= 24) && 24 <= main_~x~4)) || (((41 <= main_~y~4 && main_~x~4 <= 59) && main_~y~4 <= 41) && 59 <= main_~x~4)) || (((main_~x~4 <= 43 && 43 <= main_~x~4) && 43 <= main_~y~4) && main_~y~4 <= 43)) || (((86 <= main_~x~4 && 14 <= main_~y~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || (((main_~x~4 <= 35 && main_~y~4 <= 35) && 35 <= main_~y~4) && 35 <= main_~x~4)) || (((36 <= main_~y~4 && main_~x~4 <= 64) && main_~y~4 <= 36) && 64 <= main_~x~4)) || (((66 <= main_~x~4 && 34 <= main_~y~4) && main_~x~4 <= 66) && main_~y~4 <= 34)) || (((42 <= main_~y~4 && 58 <= main_~x~4) && main_~y~4 <= 42) && main_~x~4 <= 58)) || (((40 <= main_~y~4 && main_~x~4 <= 40) && main_~y~4 <= 40) && 40 <= main_~x~4)) || (((32 <= main_~x~4 && main_~y~4 <= 32) && main_~x~4 <= 32) && 32 <= main_~y~4)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((19 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 19)) || (((51 <= main_~x~4 && main_~y~4 <= 49) && main_~x~4 <= 51) && 49 <= main_~y~4)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((14 <= main_~y~4 && 14 <= main_~x~4) && main_~y~4 <= 14) && main_~x~4 <= 14)) || (((11 <= main_~y~4 && main_~x~4 <= 89) && 89 <= main_~x~4) && main_~y~4 <= 11)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 90 <= main_~x~4) && 10 <= main_~y~4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && main_~x~4 <= 42) && 42 <= main_~x~4)) || (((47 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 47)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || (((main_~y~4 <= 27 && main_~x~4 <= 27) && 27 <= main_~y~4) && 27 <= main_~x~4)) || (((49 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 49)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((38 <= main_~x~4 && main_~x~4 <= 38) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~y~4 <= 5 && 95 <= main_~x~4) && main_~x~4 <= 95) && 5 <= main_~y~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 32 <= main_~y~4) && main_~y~4 <= 32)) || (((21 <= main_~x~4 && main_~x~4 <= 21) && 21 <= main_~y~4) && main_~y~4 <= 21)) || (((main_~x~4 <= 44 && 44 <= main_~x~4) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 29) && 29 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && main_~y~4 <= 18) && 18 <= main_~y~4) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((37 <= main_~y~4 && 63 <= main_~x~4) && main_~y~4 <= 37) && main_~x~4 <= 63) || (((main_~x~4 <= 16 && 16 <= main_~y~4) && 16 <= main_~x~4) && main_~y~4 <= 16)) || (((17 <= main_~y~4 && main_~y~4 <= 17) && main_~x~4 <= 17) && 17 <= main_~x~4)) || (((main_~x~4 <= 7 && main_~y~4 <= 7) && 7 <= main_~y~4) && 7 <= main_~x~4)) || (((main_~x~4 <= 39 && main_~y~4 <= 39) && 39 <= main_~y~4) && 39 <= main_~x~4)) || (((19 <= main_~x~4 && main_~x~4 <= 19) && 19 <= main_~y~4) && main_~y~4 <= 19)) || (((main_~y~4 <= 27 && 27 <= main_~y~4) && main_~x~4 <= 73) && 73 <= main_~x~4)) || (((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 <= 23) && 23 <= main_~x~4)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((12 <= main_~y~4 && 88 <= main_~x~4) && main_~x~4 <= 88) && main_~y~4 <= 12)) || (((main_~x~4 <= 91 && main_~y~4 <= 9) && 9 <= main_~y~4) && 91 <= main_~x~4)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((main_~y~4 <= 15 && 15 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~x~4 <= 8 && 8 <= main_~y~4) && main_~y~4 <= 8) && 8 <= main_~x~4)) || (((main_~x~4 <= 34 && 34 <= main_~y~4) && 34 <= main_~x~4) && main_~y~4 <= 34)) || (((main_~x~4 <= 75 && 25 <= main_~y~4) && 75 <= main_~x~4) && main_~y~4 <= 25)) || (((2 <= main_~y~4 && main_~x~4 <= 98) && main_~y~4 <= 2) && 98 <= main_~x~4)) || (((20 <= main_~y~4 && main_~x~4 <= 80) && 80 <= main_~x~4) && main_~y~4 <= 20)) || (((main_~x~4 <= 62 && main_~y~4 <= 38) && 62 <= main_~x~4) && 38 <= main_~y~4)) || (((74 <= main_~x~4 && main_~y~4 <= 26) && main_~x~4 <= 74) && 26 <= main_~y~4)) || (((main_~y~4 <= 3 && 97 <= main_~x~4) && main_~x~4 <= 97) && 3 <= main_~y~4)) || (((main_~y~4 <= 15 && 15 <= main_~x~4) && main_~x~4 <= 15) && 15 <= main_~y~4)) || (((12 <= main_~x~4 && 12 <= main_~y~4) && main_~y~4 <= 12) && main_~x~4 <= 12)) || (((18 <= main_~y~4 && 18 <= main_~x~4) && main_~x~4 <= 18) && main_~y~4 <= 18)) || (((45 <= main_~y~4 && 55 <= main_~x~4) && main_~x~4 <= 55) && main_~y~4 <= 45)) || (((10 <= main_~x~4 && main_~y~4 <= 10) && main_~x~4 <= 10) && 10 <= main_~y~4)) || (((69 <= main_~x~4 && 31 <= main_~y~4) && main_~x~4 <= 69) && main_~y~4 <= 31)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((40 <= main_~y~4 && 60 <= main_~x~4) && main_~y~4 <= 40) && main_~x~4 <= 60)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 0) && 0 <= main_~x~4)) || (((47 <= main_~x~4 && 47 <= main_~y~4) && main_~x~4 <= 47) && main_~y~4 <= 47)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && main_~y~4 <= 48) && 48 <= main_~y~4)) || (((16 <= main_~y~4 && main_~x~4 <= 84) && main_~y~4 <= 16) && 84 <= main_~x~4)) || (((13 <= main_~y~4 && main_~y~4 <= 13) && main_~x~4 <= 87) && 87 <= main_~x~4)) || (((6 <= main_~x~4 && 6 <= main_~y~4) && main_~y~4 <= 6) && main_~x~4 <= 6)) || (((41 <= main_~x~4 && 41 <= main_~y~4) && main_~x~4 <= 41) && main_~y~4 <= 41)) || (((20 <= main_~x~4 && 20 <= main_~y~4) && main_~y~4 <= 20) && main_~x~4 <= 20)) || (((79 <= main_~x~4 && main_~x~4 <= 79) && 21 <= main_~y~4) && main_~y~4 <= 21)) || (((main_~x~4 <= 33 && 33 <= main_~y~4) && 33 <= main_~x~4) && main_~y~4 <= 33)) || (((28 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 28) && 28 <= main_~y~4)) || (((57 <= main_~x~4 && main_~x~4 <= 57) && main_~y~4 <= 43) && 43 <= main_~y~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((13 <= main_~x~4 && main_~y~4 <= 13) && 13 <= main_~y~4) && main_~x~4 <= 13)) || (((37 <= main_~y~4 && main_~x~4 <= 37) && main_~y~4 <= 37) && 37 <= main_~x~4)) || (((main_~y~4 <= 22 && 22 <= main_~y~4) && main_~x~4 <= 78) && 78 <= main_~x~4)) || (((26 <= main_~x~4 && main_~x~4 <= 26) && main_~y~4 <= 26) && 26 <= main_~y~4)) || (((main_~x~4 <= 1 && main_~y~4 <= 1) && 1 <= main_~y~4) && 1 <= main_~x~4)) || (((main_~x~4 <= 5 && 5 <= main_~y~4) && main_~y~4 <= 5) && 5 <= main_~x~4)) || (((main_~y~4 <= 48 && main_~x~4 <= 48) && 48 <= main_~x~4) && 48 <= main_~y~4)) || (((67 <= main_~x~4 && main_~y~4 <= 33) && 33 <= main_~y~4) && main_~x~4 <= 67)) || (((main_~x~4 <= 36 && 36 <= main_~y~4) && 36 <= main_~x~4) && main_~y~4 <= 36)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~y~4 <= 9 && 9 <= main_~x~4) && main_~x~4 <= 9) && 9 <= main_~y~4)) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 76 && main_~y~4 <= 24) && 24 <= main_~y~4) && 76 <= main_~x~4)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && main_~x~4 <= 30) && 30 <= main_~x~4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 70 <= main_~x~4) && 30 <= main_~y~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 22) && 22 <= main_~x~4) && 22 <= main_~y~4)) || (((61 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 39)) || (((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 <= 25) && 25 <= main_~x~4)) || (((main_~y~4 <= 7 && 7 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~y~4 <= 45 && main_~x~4 <= 45) && 45 <= main_~y~4) && 45 <= main_~x~4)) || (((72 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 72) && 28 <= main_~y~4)) || (((4 <= main_~y~4 && main_~x~4 <= 4) && 4 <= main_~x~4) && main_~y~4 <= 4)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((main_~x~4 <= 31 && 31 <= main_~y~4) && main_~y~4 <= 31) && 31 <= main_~x~4)) || (((main_~x~4 <= 54 && main_~y~4 <= 46) && 54 <= main_~x~4) && 46 <= main_~y~4)) || (((main_~x~4 <= 77 && 23 <= main_~y~4) && 77 <= main_~x~4) && main_~y~4 <= 23)) || (((main_~x~4 <= 46 && 46 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 46)) || (((3 <= main_~x~4 && main_~y~4 <= 3) && 3 <= main_~y~4) && main_~x~4 <= 3)) || (((main_~y~4 <= 24 && 24 <= main_~y~4) && main_~x~4 <= 24) && 24 <= main_~x~4)) || (((41 <= main_~y~4 && main_~x~4 <= 59) && main_~y~4 <= 41) && 59 <= main_~x~4)) || (((main_~x~4 <= 43 && 43 <= main_~x~4) && 43 <= main_~y~4) && main_~y~4 <= 43)) || (((86 <= main_~x~4 && 14 <= main_~y~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || (((main_~x~4 <= 35 && main_~y~4 <= 35) && 35 <= main_~y~4) && 35 <= main_~x~4)) || (((36 <= main_~y~4 && main_~x~4 <= 64) && main_~y~4 <= 36) && 64 <= main_~x~4)) || (((66 <= main_~x~4 && 34 <= main_~y~4) && main_~x~4 <= 66) && main_~y~4 <= 34)) || (((42 <= main_~y~4 && 58 <= main_~x~4) && main_~y~4 <= 42) && main_~x~4 <= 58)) || (((40 <= main_~y~4 && main_~x~4 <= 40) && main_~y~4 <= 40) && 40 <= main_~x~4)) || (((32 <= main_~x~4 && main_~y~4 <= 32) && main_~x~4 <= 32) && 32 <= main_~y~4)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((19 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 19)) || (((51 <= main_~x~4 && main_~y~4 <= 49) && main_~x~4 <= 51) && 49 <= main_~y~4)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((14 <= main_~y~4 && 14 <= main_~x~4) && main_~y~4 <= 14) && main_~x~4 <= 14)) || (((11 <= main_~y~4 && main_~x~4 <= 89) && 89 <= main_~x~4) && main_~y~4 <= 11)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 90 <= main_~x~4) && 10 <= main_~y~4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && main_~x~4 <= 42) && 42 <= main_~x~4)) || (((47 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 47)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || (((main_~y~4 <= 27 && main_~x~4 <= 27) && 27 <= main_~y~4) && 27 <= main_~x~4)) || (((49 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 49)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((38 <= main_~x~4 && main_~x~4 <= 38) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~y~4 <= 5 && 95 <= main_~x~4) && main_~x~4 <= 95) && 5 <= main_~y~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 32 <= main_~y~4) && main_~y~4 <= 32)) || (((21 <= main_~x~4 && main_~x~4 <= 21) && 21 <= main_~y~4) && main_~y~4 <= 21)) || (((main_~x~4 <= 44 && 44 <= main_~x~4) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 29) && 29 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && main_~y~4 <= 18) && 18 <= main_~y~4) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((15 <= main_~x~4 && 16 <= main_~y~4) && main_~x~4 <= 15) && main_~y~4 <= 16) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4)) || (((main_~x~4 <= 33 && 33 <= main_~x~4) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((main_~y~4 <= 26 && main_~x~4 <= 73) && 73 <= main_~x~4) && 26 <= main_~y~4)) || (((main_~x~4 <= 21 && main_~y~4 <= 22) && 21 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 7 && 6 <= main_~x~4) && 7 <= main_~y~4) && main_~x~4 <= 6)) || (((18 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 18)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~x~4 <= 43 && main_~y~4 <= 44) && 44 <= main_~y~4) && 43 <= main_~x~4)) || (((45 <= main_~y~4 && main_~x~4 <= 54) && 54 <= main_~x~4) && main_~y~4 <= 45)) || (((main_~y~4 <= 10 && main_~x~4 <= 89) && 89 <= main_~x~4) && 10 <= main_~y~4)) || (((79 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 20)) || (((main_~x~4 <= 46 && 47 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 47)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~y~4 <= 39 && 60 <= main_~x~4) && 39 <= main_~y~4) && main_~x~4 <= 60)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((19 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 19) && 80 <= main_~x~4)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 4) && 4 <= main_~x~4)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && 35 <= main_~y~4) && main_~y~4 <= 35)) || (((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((main_~x~4 <= 37 && main_~y~4 <= 38) && 38 <= main_~y~4) && 37 <= main_~x~4)) || (((25 <= main_~y~4 && main_~x~4 <= 24) && main_~y~4 <= 25) && 24 <= main_~x~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 41) && 40 <= main_~x~4) && 41 <= main_~y~4)) || (((main_~y~4 <= 27 && 72 <= main_~x~4) && 27 <= main_~y~4) && main_~x~4 <= 72)) || (((main_~x~4 <= 90 && main_~y~4 <= 9) && 90 <= main_~x~4) && 9 <= main_~y~4)) || (((main_~y~4 <= 9 && main_~x~4 <= 8) && 8 <= main_~x~4) && 9 <= main_~y~4)) || (((43 <= main_~y~4 && main_~x~4 <= 42) && main_~y~4 <= 43) && 42 <= main_~x~4)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((main_~x~4 <= 39 && main_~y~4 <= 40) && 39 <= main_~x~4) && 40 <= main_~y~4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((main_~y~4 <= 30 && 29 <= main_~x~4) && 30 <= main_~y~4) && main_~x~4 <= 29)) || (((4 <= main_~y~4 && 95 <= main_~x~4) && main_~x~4 <= 95) && main_~y~4 <= 4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((main_~y~4 <= 15 && main_~x~4 <= 84) && 84 <= main_~x~4) && 15 <= main_~y~4)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 43) && 43 <= main_~y~4)) || (((main_~x~4 <= 70 && 70 <= main_~x~4) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((36 <= main_~x~4 && 37 <= main_~y~4) && main_~y~4 <= 37) && main_~x~4 <= 36)) || (((main_~x~4 <= 32 && 33 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 33)) || (((main_~y~4 <= 10 && 9 <= main_~x~4) && 10 <= main_~y~4) && main_~x~4 <= 9)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && 45 <= main_~y~4) && main_~y~4 <= 45)) || (((35 <= main_~y~4 && main_~x~4 <= 64) && 64 <= main_~x~4) && main_~y~4 <= 35)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && 46 <= main_~y~4) && main_~y~4 <= 46)) || (((12 <= main_~y~4 && main_~x~4 <= 87) && main_~y~4 <= 12) && 87 <= main_~x~4)) || (((main_~x~4 <= 62 && 37 <= main_~y~4) && main_~y~4 <= 37) && 62 <= main_~x~4)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && main_~y~4 <= 47) && 47 <= main_~y~4)) || (((main_~y~4 <= 46 && 46 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((74 <= main_~x~4 && main_~y~4 <= 25) && 25 <= main_~y~4) && main_~x~4 <= 74)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((38 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 38) && main_~y~4 <= 39)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((14 <= main_~y~4 && main_~y~4 <= 14) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 2 && 97 <= main_~x~4) && 2 <= main_~y~4) && main_~x~4 <= 97)) || (((main_~x~4 <= 30 && 31 <= main_~y~4) && 30 <= main_~x~4) && main_~y~4 <= 31)) || (((main_~y~4 <= 7 && main_~x~4 <= 92) && 7 <= main_~y~4) && 92 <= main_~x~4)) || (((main_~y~4 <= 41 && 41 <= main_~y~4) && 58 <= main_~x~4) && main_~x~4 <= 58)) || (((20 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 21)) || (((main_~x~4 <= 59 && 40 <= main_~y~4) && main_~y~4 <= 40) && 59 <= main_~x~4)) || (((main_~x~4 <= 31 && 32 <= main_~y~4) && 31 <= main_~x~4) && main_~y~4 <= 32)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && 12 <= main_~y~4) && main_~y~4 <= 12)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 42) && 42 <= main_~y~4)) || (((main_~y~4 <= 27 && main_~x~4 <= 26) && 27 <= main_~y~4) && 26 <= main_~x~4)) || (((3 <= main_~x~4 && 4 <= main_~y~4) && main_~x~4 <= 3) && main_~y~4 <= 4)) || (((48 <= main_~y~4 && 47 <= main_~x~4) && main_~y~4 <= 48) && main_~x~4 <= 47)) || (((88 <= main_~x~4 && main_~x~4 <= 88) && 11 <= main_~y~4) && main_~y~4 <= 11)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 28) && 28 <= main_~y~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && main_~x~4 <= 1) && 1 <= main_~x~4)) || (((main_~x~4 <= 50 && 50 <= main_~x~4) && main_~y~4 <= 49) && 49 <= main_~y~4)) || (((main_~x~4 <= 35 && 35 <= main_~x~4) && main_~y~4 <= 36) && 36 <= main_~y~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 31 <= main_~y~4) && main_~y~4 <= 31)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && 19 <= main_~y~4) && main_~y~4 <= 19)) || (((34 <= main_~y~4 && main_~y~4 <= 34) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~y~4 <= 44 && 44 <= main_~y~4) && 55 <= main_~x~4) && main_~x~4 <= 55)) || ((main_~y~4 + 1 <= 0 && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((12 <= main_~x~4 && main_~y~4 <= 13) && 13 <= main_~y~4) && main_~x~4 <= 12)) || (((main_~x~4 <= 77 && main_~y~4 <= 22) && 77 <= main_~x~4) && 22 <= main_~y~4)) || (((14 <= main_~y~4 && 13 <= main_~x~4) && main_~y~4 <= 14) && main_~x~4 <= 13)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 0 && 0 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 76 && main_~y~4 <= 23) && 23 <= main_~y~4) && 76 <= main_~x~4)) || (((48 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 48)) || (((main_~x~4 <= 78 && 21 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 21)) || (((main_~y~4 <= 15 && 14 <= main_~x~4) && main_~x~4 <= 14) && 15 <= main_~y~4)) || (((83 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 83)) || (((main_~y~4 <= 26 && main_~x~4 <= 25) && 26 <= main_~y~4) && 25 <= main_~x~4)) || (((51 <= main_~x~4 && main_~y~4 <= 48) && 48 <= main_~y~4) && main_~x~4 <= 51)) || (((main_~x~4 <= 75 && 75 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((20 <= main_~y~4 && 19 <= main_~x~4) && main_~x~4 <= 19) && main_~y~4 <= 20)) || (((18 <= main_~y~4 && main_~x~4 <= 17) && main_~y~4 <= 18) && 17 <= main_~x~4)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && 69 <= main_~x~4) && main_~x~4 <= 69)) || (((main_~x~4 <= 28 && main_~y~4 <= 29) && 29 <= main_~y~4) && 28 <= main_~x~4)) || (((33 <= main_~y~4 && 66 <= main_~x~4) && main_~x~4 <= 66) && main_~y~4 <= 33)) || (((main_~x~4 <= 91 && 8 <= main_~y~4) && 91 <= main_~x~4) && main_~y~4 <= 8)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~x~4 <= 5 && 6 <= main_~y~4) && main_~y~4 <= 6) && 5 <= main_~x~4)) || (((main_~x~4 <= 16 && 17 <= main_~y~4) && main_~y~4 <= 17) && 16 <= main_~x~4)) || (((main_~x~4 <= 7 && 7 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((63 <= main_~x~4 && 36 <= main_~y~4) && main_~y~4 <= 36) && main_~x~4 <= 63)) || (((main_~x~4 <= 27 && main_~y~4 <= 28) && 27 <= main_~x~4) && 28 <= main_~y~4)) || (((main_~x~4 <= 10 && main_~y~4 <= 11) && 11 <= main_~y~4) && 10 <= main_~x~4)) || (((67 <= main_~x~4 && 32 <= main_~y~4) && main_~y~4 <= 32) && main_~x~4 <= 67) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 186.9s OverallTime, 47 OverallIterations, 103 TraceHistogramMax, 51.6s AutomataDifference, 0.0s DeadEndRemovalTime, 37.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 523 SDtfs, 873 SDslu, 8663 SDs, 0 SdLazy, 15898 SolverSat, 1930 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10876 GetRequests, 8111 SyntacticMatches, 700 SemanticMatches, 2065 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33677 ImplicationChecksByTransitivity, 70.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4183occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 25.6s AutomataMinimizationTime, 47 MinimizatonAttempts, 2356 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 307 NumberOfFragments, 3942 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2766108635522847 FormulaSimplificationTreeSizeReduction, 12.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 22234084891025 FormulaSimplificationTreeSizeReductionInter, 24.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 66.6s InterpolantComputationTime, 9623 NumberOfCodeBlocks, 9269 NumberOfCodeBlocksAsserted, 508 NumberOfCheckSat, 14139 ConstructedInterpolants, 0 QuantifiedInterpolants, 6140705 SizeOfPredicates, 59 NumberOfNonLiveVariables, 10305 ConjunctsInSsa, 1238 ConjunctsInUnsatCore, 135 InterpolantComputations, 3 PerfectInterpolantSequences, 189717/356274 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...