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_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:28:33,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:28:33,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:28:33,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:28:33,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:28:33,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:28:33,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:28:33,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:28:33,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:28:33,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:28:33,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:28:33,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:28:33,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:28:33,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:28:33,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:28:33,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:28:33,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:28:33,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:28:33,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:28:33,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:28:33,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:28:33,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:28:33,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:28:33,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:28:33,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:28:33,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:28:33,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:28:33,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:28:33,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:28:33,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:28:33,603 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:28:33,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:28:33,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:28:33,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:28:33,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:28:33,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:28:33,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:28:33,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:28:33,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:28:33,620 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:28:33,620 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:28:33,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:28:33,621 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:28:33,621 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:28:33,621 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:28:33,621 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:28:33,621 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:28:33,622 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:28:33,622 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:28:33,622 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:28:33,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:28:33,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:28:33,623 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:28:33,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:28:33,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:28:33,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:28:33,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:28:33,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:28:33,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:28:33,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:28:33,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:28:33,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:28:33,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:28:33,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:28:33,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:28:33,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:28:33,626 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:28:33,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:33,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:28:33,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:28:33,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:28:33,627 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:28:33,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:28:33,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:28:33,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:28:33,628 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:28:33,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:28:33,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:28:33,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:28:33,677 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:28:33,677 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:28:33,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2018-12-03 17:28:33,678 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2018-12-03 17:28:33,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:28:33,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:28:33,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:33,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:28:33,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:28:33,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:33,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:28:33,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:28:33,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:28:33,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/1) ... [2018-12-03 17:28:33,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:28:33,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:28:33,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:28:33,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:28:33,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (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 17:28:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:28:33,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:28:34,108 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:28:34,109 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:28:34,109 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:34 BoogieIcfgContainer [2018-12-03 17:28:34,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:28:34,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:28:34,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:28:34,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:28:34,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:33" (1/2) ... [2018-12-03 17:28:34,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11709a40 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:34, skipping insertion in model container [2018-12-03 17:28:34,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:34" (2/2) ... [2018-12-03 17:28:34,118 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2018-12-03 17:28:34,130 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:28:34,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:28:34,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:28:34,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:28:34,197 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:28:34,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:28:34,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:28:34,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:28:34,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:28:34,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:28:34,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:28:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:28:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:28:34,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:34,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:28:34,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:34,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:34,234 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:28:34,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,382 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 17:28:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:34,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:34,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:34,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:34,402 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:28:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:34,462 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:28:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:34,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:28:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:34,476 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:28:34,477 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:28:34,480 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 17:28:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:28:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:28:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:28:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:28:34,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:28:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:34,518 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:28:34,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:28:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:28:34,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:34,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:28:34,519 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:34,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 17:28:34,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:34,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:34,658 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:28:34,660 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:28:34,738 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:28:34,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:28:42,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:28:42,261 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:28:42,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:42,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:28:42,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:42,277 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 17:28:42,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:42,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:42,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:28:42,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:42,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:28:42,498 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 17:28:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:42,520 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 17:28:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:28:42,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 17:28:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:42,521 INFO L225 Difference]: With dead ends: 8 [2018-12-03 17:28:42,521 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:28:42,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:28:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:28:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:28:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:28:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:28:42,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:28:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:42,526 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:28:42,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:28:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:28:42,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:42,527 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:28:42,532 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:42,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 17:28:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:42,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:42,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:42,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:42,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:42,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:42,594 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 17:28:42,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:42,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:42,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:28:42,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:42,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:42,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:28:42,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:42,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:28:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:28:42,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:28:42,721 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 17:28:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:42,738 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:28:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:42,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:28:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:42,741 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:28:42,741 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:28:42,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:28:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:28:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:28:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:28:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:28:42,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:28:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:42,745 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:28:42,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:28:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:28:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:28:42,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:42,746 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:28:42,746 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:42,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 17:28:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:42,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:42,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:42,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:42,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:42,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:42,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:42,812 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 17:28:42,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:42,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:42,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:42,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:42,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:42,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:28:43,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:43,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:28:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:28:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:28:43,019 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 17:28:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:43,034 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:28:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:28:43,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 17:28:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:43,036 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:28:43,036 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:28:43,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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 17:28:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:28:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:28:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:28:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:28:43,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 17:28:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:43,039 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:28:43,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:28:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:28:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:28:43,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:43,040 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 17:28:43,041 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:43,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 17:28:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:43,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:43,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:43,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:43,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:43,131 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 17:28:43,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:43,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:43,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:43,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:28:43,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:43,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:28:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:28:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:28:43,356 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 17:28:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:43,400 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 17:28:43,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:28:43,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 17:28:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:43,401 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:28:43,401 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:28:43,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:28:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:28:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:28:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:28:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:28:43,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 17:28:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:43,404 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:28:43,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:28:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:28:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:28:43,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:43,405 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:28:43,405 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:43,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 17:28:43,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:43,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:43,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:43,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:43,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:43,483 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 17:28:43,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:43,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:43,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:28:43,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:43,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:43,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 17:28:43,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:43,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:28:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:28:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:28:43,671 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 17:28:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:43,709 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:28:43,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:28:43,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:28:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:43,711 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:28:43,711 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:28:43,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:28:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:28:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:28:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:28:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:28:43,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 17:28:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:43,715 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:28:43,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:28:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:28:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:28:43,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:43,716 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 17:28:43,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:43,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:43,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 17:28:43,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:43,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:43,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:43,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:43,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:43,833 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 17:28:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:43,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:43,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:43,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:43,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:43,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:44,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:28:44,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:44,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:28:44,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:28:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:28:44,111 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 17:28:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:44,136 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 17:28:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:28:44,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:28:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:44,138 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:28:44,138 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:28:44,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:28:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:28:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:28:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:28:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:28:44,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 17:28:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:44,142 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:28:44,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:28:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:28:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:28:44,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:44,143 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:28:44,143 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:44,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 17:28:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:44,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:44,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:44,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:44,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:44,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:44,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:44,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:44,285 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 17:28:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:44,295 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:44,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:44,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:28:44,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:44,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:28:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:28:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:28:44,584 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 17:28:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:44,612 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:28:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:28:44,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 17:28:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:44,617 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:28:44,617 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 17:28:44,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:28:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 17:28:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 17:28:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:28:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:28:44,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 17:28:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:44,622 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:28:44,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:28:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:28:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:28:44,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:44,623 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:28:44,623 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:44,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 17:28:44,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:44,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:44,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:44,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:44,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:44,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:44,749 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 17:28:44,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:44,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:44,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:28:44,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:44,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:45,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:45,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:28:45,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:45,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:28:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:28:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:28:45,021 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 17:28:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:45,042 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 17:28:45,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:28:45,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:28:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:45,043 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:28:45,043 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:28:45,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:28:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:28:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:28:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:28:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:28:45,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 17:28:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:45,047 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:28:45,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:28:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:28:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:28:45,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:45,048 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:28:45,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:45,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:45,049 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 17:28:45,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:45,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:45,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:45,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:45,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:45,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:45,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:45,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:45,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:45,181 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 17:28:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:45,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:45,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:45,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:45,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:45,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:45,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:45,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:28:45,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:45,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:28:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:28:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:28:45,577 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 17:28:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:45,669 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:28:45,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:28:45,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:28:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:45,670 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:28:45,670 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:28:45,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:28:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:28:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:28:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:28:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:28:45,673 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 17:28:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:45,674 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:28:45,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:28:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:28:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:28:45,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:45,675 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 17:28:45,675 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:45,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 17:28:45,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:45,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:45,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:45,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:45,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:45,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:45,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:45,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:45,833 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 17:28:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:45,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:45,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:45,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:46,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:46,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:28:46,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:46,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:28:46,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:28:46,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:28:46,175 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 17:28:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:46,224 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 17:28:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:28:46,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 17:28:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:46,226 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:28:46,226 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:28:46,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:28:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:28:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:28:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:28:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:28:46,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 17:28:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:46,231 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:28:46,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:28:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:28:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:46,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:46,232 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:28:46,232 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:46,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 17:28:46,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:46,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:46,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:46,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:46,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:46,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:46,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:46,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:46,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:46,393 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 17:28:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:46,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:46,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:28:46,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:46,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:46,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:46,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:46,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:28:46,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:46,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:28:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:28:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:28:46,784 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 17:28:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:46,852 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:28:46,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:28:46,853 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 17:28:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:46,853 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:28:46,853 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:28:46,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:28:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:28:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:28:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:28:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:28:46,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 17:28:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:46,857 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:28:46,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:28:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:28:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:28:46,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:46,858 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 17:28:46,858 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:46,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:46,859 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 17:28:46,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:46,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:46,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:46,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:47,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:47,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:47,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:47,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:47,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:47,001 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 17:28:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:47,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:47,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:47,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:47,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:47,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:47,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:47,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:28:47,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:47,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:28:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:28:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:28:47,531 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 17:28:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:47,568 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 17:28:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:28:47,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:28:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:47,569 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:28:47,570 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:28:47,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:28:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:28:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:28:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:28:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:28:47,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 17:28:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:47,574 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:28:47,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:28:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:28:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:47,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:47,575 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:28:47,575 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:47,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 17:28:47,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:47,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:47,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:47,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:47,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:47,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:47,731 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:47,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:47,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:47,732 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 17:28:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:47,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:47,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:47,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:48,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:48,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:28:48,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:48,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:28:48,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:28:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:28:48,194 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 17:28:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:48,332 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:28:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:28:48,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 17:28:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:48,339 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:28:48,339 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:28:48,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:28:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:28:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:28:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:28:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:28:48,342 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 17:28:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:48,346 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:28:48,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:28:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:28:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:28:48,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:48,347 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 17:28:48,348 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:48,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 17:28:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:48,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:48,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:48,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:48,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:48,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:48,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:48,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:48,544 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 17:28:48,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:48,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:48,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:28:48,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:48,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:48,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:48,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:48,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:28:48,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:48,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:28:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:28:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:28:48,952 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 17:28:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:48,980 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 17:28:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:28:48,981 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 17:28:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:48,982 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:28:48,982 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:28:48,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:28:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:28:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:28:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:28:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:28:48,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 17:28:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:48,986 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:28:48,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:28:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:28:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:28:48,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:48,987 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:28:48,987 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:48,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 17:28:48,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:48,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:48,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:49,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:49,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:49,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:49,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:49,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:49,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:49,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:49,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:49,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:49,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:49,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:49,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:49,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:28:49,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:49,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:28:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:28:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:28:49,663 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 17:28:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:49,695 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:28:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:28:49,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:28:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:49,696 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:28:49,696 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:28:49,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:28:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:28:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:28:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:28:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:28:49,701 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 17:28:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:49,701 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:28:49,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:28:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:28:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:28:49,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:49,702 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 17:28:49,702 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:49,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 17:28:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:49,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:49,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:50,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:50,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:50,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:50,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:50,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:50,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 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 17:28:50,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:50,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:50,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:50,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:51,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:51,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:28:51,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:51,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:28:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:28:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:28:51,208 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 17:28:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:51,235 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 17:28:51,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:28:51,237 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 17:28:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:51,237 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:28:51,237 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:28:51,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:28:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:28:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:28:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:28:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:28:51,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 17:28:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:51,242 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:28:51,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:28:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:28:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:28:51,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:51,242 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:28:51,242 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:51,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 17:28:51,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:51,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:51,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:51,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:51,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:51,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:51,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:51,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:51,500 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 17:28:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:51,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:51,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:28:51,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:51,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:51,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:52,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:52,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:28:52,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:52,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:28:52,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:28:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:28:52,564 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 17:28:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:52,596 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:28:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:28:52,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 17:28:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:52,599 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:28:52,599 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:28:52,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:28:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:28:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:28:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:28:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:28:52,604 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 17:28:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:52,604 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:28:52,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:28:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:28:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:28:52,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:52,615 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 17:28:52,615 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:52,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 17:28:52,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:52,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:52,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:53,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:53,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:53,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:53,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:53,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:53,429 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 17:28:53,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:53,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:53,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:53,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:53,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:53,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:28:53,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:53,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:28:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:28:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:28:53,919 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 17:28:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:53,955 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 17:28:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:28:53,955 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 17:28:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:53,956 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:28:53,956 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:28:53,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:28:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:28:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:28:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:28:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:28:53,961 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 17:28:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:53,961 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:28:53,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:28:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:28:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:28:53,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:53,962 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:28:53,962 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:53,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 17:28:53,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:53,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:53,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:53,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:54,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:54,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:54,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:54,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:54,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:54,263 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 17:28:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:54,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:54,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:54,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:54,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:28:54,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:54,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:28:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:28:54,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:28:54,851 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 17:28:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:54,892 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:28:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:28:54,893 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 17:28:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:54,894 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:28:54,894 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:28:54,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 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 17:28:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:28:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:28:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:28:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:28:54,897 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 17:28:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:54,897 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:28:54,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:28:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:28:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:28:54,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:54,898 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 17:28:54,899 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:54,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 17:28:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:54,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:55,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:55,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:55,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:55,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:55,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:55,159 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 17:28:55,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:55,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:55,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:28:55,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:55,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:55,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:55,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:28:55,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:55,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:28:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:28:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:28:55,891 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 17:28:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:55,956 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 17:28:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:28:55,956 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 17:28:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:55,957 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:28:55,957 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:28:55,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:28:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:28:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:28:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:28:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:28:55,962 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 17:28:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:55,962 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:28:55,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:28:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:28:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:28:55,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:55,963 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:28:55,963 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:55,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 17:28:55,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:55,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:55,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:55,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:55,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:56,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:56,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:56,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:56,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:56,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:56,313 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 17:28:56,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:56,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:56,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:56,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:56,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:56,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:56,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:56,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:28:56,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:28:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:28:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:28:56,965 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 17:28:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:57,037 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:28:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:28:57,038 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 17:28:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:57,039 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:28:57,039 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:28:57,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:28:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:28:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:28:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:28:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:28:57,044 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 17:28:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:57,044 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:28:57,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:28:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:28:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:28:57,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:57,045 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 17:28:57,045 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:57,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 17:28:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:57,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:57,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:57,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:57,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:57,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:57,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:57,421 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 17:28:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:57,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:57,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:57,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:58,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:58,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:28:58,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:58,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:28:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:28:58,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:28:58,467 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 17:28:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:58,537 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 17:28:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:28:58,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 17:28:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:58,538 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:28:58,538 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:28:58,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:28:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:28:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:28:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:28:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:28:58,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 17:28:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:58,543 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:28:58,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:28:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:28:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:28:58,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:58,544 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:28:58,544 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:58,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:58,544 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 17:28:58,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:58,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:58,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:58,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:58,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:58,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:58,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:58,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:58,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:58,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:58,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:28:58,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:58,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:58,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:59,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:59,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:28:59,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:59,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:28:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:28:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:28:59,651 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 17:28:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:59,696 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:28:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:28:59,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 17:28:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:59,697 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:28:59,697 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:28:59,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:28:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:28:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:28:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:28:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:28:59,703 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 17:28:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:59,703 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:28:59,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:28:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:28:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:28:59,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:59,704 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 17:28:59,704 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:59,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 17:28:59,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:59,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:59,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:59,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:00,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:00,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:00,686 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:00,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:00,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:00,687 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 17:29:00,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:00,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:00,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:00,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:00,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:00,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:01,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:01,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:29:01,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:01,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:29:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:29:01,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:29:01,494 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 17:29:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:01,550 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 17:29:01,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:29:01,550 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 17:29:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:01,551 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:29:01,551 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:29:01,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:29:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:29:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:29:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:29:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:29:01,556 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 17:29:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:01,556 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:29:01,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:29:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:29:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:29:01,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:01,557 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:29:01,558 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:01,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 17:29:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:01,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:01,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:01,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:01,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:01,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:01,968 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 17:29:01,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:01,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:02,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:02,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:03,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:03,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:29:03,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:03,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:29:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:29:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:29:03,489 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 17:29:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:03,650 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:29:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:29:03,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 17:29:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:03,652 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:29:03,652 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:29:03,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:29:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:29:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:29:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:29:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:29:03,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 17:29:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:03,656 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:29:03,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:29:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:29:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:29:03,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:03,658 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 17:29:03,658 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:03,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 17:29:03,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:03,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:03,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:04,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:04,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:04,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:04,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,264 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 17:29:04,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:04,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:04,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:29:04,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:04,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:04,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:05,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:05,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:29:05,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:05,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:29:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:29:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:29:05,223 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 17:29:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:05,454 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 17:29:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:29:05,455 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 17:29:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:05,456 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:29:05,456 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:29:05,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:29:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:29:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:29:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:29:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:29:05,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 17:29:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:05,461 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:29:05,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:29:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:29:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:29:05,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:05,462 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:29:05,462 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:05,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:05,462 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 17:29:05,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:05,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:05,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:05,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:05,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:05,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:05,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:05,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:05,949 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 17:29:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:05,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:05,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:05,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:05,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:05,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:29:06,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:06,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:29:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:29:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:29:06,871 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 17:29:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:06,904 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:29:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:29:06,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 17:29:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:06,905 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:29:06,905 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:29:06,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:29:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:29:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:29:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:29:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:29:06,911 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 17:29:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:06,911 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:29:06,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:29:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:29:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:29:06,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:06,912 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 17:29:06,912 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:06,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 17:29:06,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:06,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:06,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:07,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:07,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:07,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:07,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:07,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:07,359 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 17:29:07,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:07,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:07,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:07,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:29:08,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:08,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:29:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:29:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:29:08,383 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 17:29:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:08,476 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 17:29:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:29:08,476 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 17:29:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:08,477 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:29:08,477 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:29:08,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:29:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:29:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:29:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:29:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:29:08,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 17:29:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:08,481 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:29:08,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:29:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:29:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:29:08,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:08,482 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:29:08,482 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:08,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 17:29:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:08,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:08,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:09,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:09,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:09,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:09,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:09,516 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 17:29:09,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:09,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:09,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:29:09,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:09,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:09,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:29:10,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:10,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:29:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:29:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:29:10,784 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 17:29:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:10,838 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 17:29:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:29:10,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 17:29:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:10,840 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:29:10,840 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:29:10,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:29:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:29:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 17:29:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:29:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 17:29:10,844 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 17:29:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:10,844 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 17:29:10,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:29:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 17:29:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:29:10,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:10,845 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 17:29:10,845 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:10,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 17:29:10,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:10,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:10,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:11,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:11,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:11,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:11,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:11,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:11,350 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 17:29:11,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:11,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:11,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:11,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:11,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:11,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:12,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:12,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:29:12,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:12,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:29:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:29:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:29:12,445 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 17:29:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:12,505 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 17:29:12,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:29:12,505 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 17:29:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:12,506 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:29:12,506 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:29:12,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:29:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:29:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:29:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:29:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 17:29:12,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 17:29:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:12,510 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 17:29:12,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:29:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 17:29:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:29:12,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:12,511 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 17:29:12,511 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:12,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 17:29:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:12,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:12,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:13,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:13,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:13,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:13,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:13,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:13,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:13,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:13,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:13,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:13,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:14,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:14,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:29:14,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:14,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:29:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:29:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:29:14,547 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 17:29:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:14,628 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 17:29:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:29:14,629 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 17:29:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:14,629 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:29:14,630 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:29:14,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:29:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:29:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 17:29:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:29:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 17:29:14,634 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 17:29:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:14,634 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 17:29:14,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:29:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 17:29:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:29:14,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:14,635 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 17:29:14,635 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:14,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 17:29:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:14,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:14,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:15,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:15,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:15,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:15,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:15,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:15,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:15,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:15,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:15,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:29:15,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:15,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:15,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:16,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:16,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:29:16,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:16,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:29:16,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:29:16,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:29:16,520 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 17:29:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:16,589 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 17:29:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:29:16,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 17:29:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:16,591 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:29:16,591 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:29:16,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:29:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:29:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:29:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:29:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:29:16,595 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 17:29:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:16,595 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:29:16,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:29:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:29:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:29:16,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:16,596 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 17:29:16,596 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:16,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 17:29:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:16,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:16,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:17,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:17,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:17,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:17,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:17,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:17,151 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 17:29:17,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:17,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:17,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:17,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:17,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:17,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:18,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:18,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:29:18,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:18,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:29:18,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:29:18,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:29:18,473 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 17:29:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:18,580 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 17:29:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:29:18,581 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 17:29:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:18,581 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:29:18,582 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:29:18,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:29:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:29:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 17:29:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:29:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 17:29:18,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 17:29:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:18,584 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 17:29:18,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:29:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 17:29:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:29:18,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:18,586 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 17:29:18,586 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:18,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 17:29:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:18,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:18,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:20,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:20,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:20,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:20,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:20,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:20,422 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 17:29:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:20,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:20,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:20,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:21,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:21,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:29:21,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:21,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:29:21,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:29:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:29:21,997 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 17:29:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:22,068 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 17:29:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:29:22,068 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 17:29:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:22,069 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:29:22,069 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:29:22,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:29:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:29:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:29:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:29:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 17:29:22,073 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 17:29:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:22,073 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 17:29:22,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:29:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 17:29:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:29:22,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:22,074 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 17:29:22,074 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:22,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 17:29:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:22,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:22,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:22,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:22,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:22,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:22,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:22,795 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 17:29:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:22,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:22,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:29:22,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:22,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:22,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:24,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:24,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:29:24,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:24,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:29:24,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:29:24,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:29:24,685 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 17:29:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:24,736 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 17:29:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:29:24,736 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 17:29:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:24,737 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:29:24,737 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:29:24,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:29:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:29:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:29:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:29:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 17:29:24,741 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 17:29:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:24,741 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 17:29:24,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:29:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 17:29:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:29:24,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:24,742 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 17:29:24,742 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 17:29:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:24,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:24,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:24,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:25,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:25,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:25,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:25,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:25,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:25,389 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 17:29:25,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:25,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:25,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:25,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:25,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:25,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:26,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:29:26,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:26,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:29:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:29:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:29:26,986 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 17:29:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:27,040 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 17:29:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:29:27,041 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 17:29:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:27,041 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:29:27,041 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:29:27,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:29:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:29:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:29:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:29:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 17:29:27,044 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 17:29:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:27,045 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 17:29:27,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:29:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 17:29:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:29:27,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:27,046 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 17:29:27,046 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:27,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 17:29:27,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:27,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:27,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:27,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:27,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:27,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:27,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:27,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:27,633 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 17:29:27,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:27,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:27,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:27,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:29:29,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:29:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:29:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:29:29,558 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 17:29:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:29,623 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 17:29:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:29:29,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 17:29:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:29,624 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:29:29,624 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:29:29,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:29:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:29:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:29:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:29:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 17:29:29,627 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 17:29:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:29,627 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 17:29:29,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:29:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 17:29:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:29:29,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:29,628 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 17:29:29,628 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:29,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 17:29:29,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:29,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:29,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:29,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:29,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:30,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:30,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:30,282 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:30,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:30,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:30,282 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 17:29:30,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:30,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:30,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:29:30,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:30,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:30,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:32,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:29:32,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:32,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:29:32,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:29:32,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:29:32,351 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 17:29:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:32,430 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 17:29:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:29:32,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 17:29:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:32,432 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:29:32,432 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:29:32,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:29:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:29:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:29:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:29:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 17:29:32,435 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 17:29:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:32,436 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 17:29:32,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:29:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 17:29:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:29:32,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:32,436 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 17:29:32,437 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:32,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 17:29:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:32,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:32,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:33,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:33,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:33,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:33,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:33,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:33,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:33,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:33,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:33,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:33,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:33,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:35,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:29:35,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:35,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:29:35,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:29:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:29:35,234 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 17:29:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:35,304 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 17:29:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:29:35,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 17:29:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:35,305 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:29:35,305 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:29:35,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:29:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:29:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:29:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:29:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 17:29:35,308 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 17:29:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:35,308 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 17:29:35,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:29:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 17:29:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:29:35,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:35,309 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 17:29:35,309 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:35,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 17:29:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:35,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:35,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:36,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:36,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:36,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:36,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:36,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:36,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:36,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:36,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:36,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:37,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:29:37,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:37,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:29:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:29:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:29:37,870 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 17:29:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:37,971 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 17:29:37,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:29:37,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 17:29:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:37,974 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:29:37,974 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:29:37,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:29:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:29:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:29:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:29:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 17:29:37,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 17:29:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:37,976 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 17:29:37,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:29:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 17:29:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:29:37,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:37,977 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 17:29:37,977 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:37,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 17:29:37,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:37,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:37,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:37,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:37,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:38,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:38,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:38,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:38,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:38,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:38,703 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 17:29:38,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:38,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:38,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:29:38,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:38,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:38,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:41,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:41,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:29:41,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:41,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:29:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:29:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:29:41,081 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 17:29:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:41,155 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 17:29:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:29:41,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 17:29:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:41,157 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:29:41,157 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:29:41,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:29:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:29:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:29:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:29:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 17:29:41,160 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 17:29:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:41,160 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 17:29:41,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:29:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 17:29:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:29:41,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:41,161 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 17:29:41,161 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:41,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-03 17:29:41,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:41,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:41,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:41,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:41,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:41,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:41,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:41,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:41,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:41,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:41,953 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 17:29:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:41,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:42,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:42,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:42,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:42,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:29:44,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:44,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:29:44,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:29:44,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:29:44,500 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 17:29:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:44,602 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 17:29:44,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:29:44,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 17:29:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:44,602 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:29:44,603 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:29:44,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:29:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:29:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:29:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:29:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 17:29:44,605 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 17:29:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:44,605 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 17:29:44,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:29:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 17:29:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:29:44,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:44,606 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 17:29:44,606 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:44,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-03 17:29:44,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:44,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:44,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:44,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:44,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:45,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:45,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:45,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:45,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:45,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:45,439 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 17:29:45,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:45,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:45,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:45,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:47,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:47,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:29:47,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:47,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:29:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:29:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:29:47,561 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 17:29:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:47,634 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 17:29:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:29:47,634 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 17:29:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:47,635 INFO L225 Difference]: With dead ends: 50 [2018-12-03 17:29:47,635 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:29:47,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:29:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:29:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:29:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:29:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 17:29:47,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 17:29:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:47,638 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 17:29:47,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:29:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 17:29:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:29:47,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:47,639 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 17:29:47,640 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:47,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-03 17:29:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:47,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:47,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:48,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:48,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:48,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:48,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:48,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:48,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:48,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:48,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:48,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:29:48,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:48,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:48,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:51,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:51,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:29:51,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:51,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:29:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:29:51,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:29:51,304 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 17:29:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:51,414 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 17:29:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:29:51,414 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 17:29:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:51,415 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:29:51,415 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:29:51,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:29:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:29:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:29:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:29:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 17:29:51,418 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 17:29:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:51,419 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 17:29:51,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:29:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 17:29:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:29:51,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:51,419 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 17:29:51,419 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:51,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-03 17:29:51,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:51,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:51,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:51,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:51,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:52,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:52,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:52,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:52,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:52,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:52,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:52,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:52,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:52,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:52,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:52,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:52,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:54,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:29:54,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:54,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:29:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:29:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:29:54,872 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 17:29:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:55,194 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 17:29:55,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:29:55,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 17:29:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:55,195 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:29:55,195 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:29:55,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:29:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:29:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:29:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:29:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 17:29:55,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 17:29:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:55,199 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 17:29:55,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:29:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 17:29:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:29:55,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:55,200 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 17:29:55,200 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:55,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:55,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-03 17:29:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:55,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:55,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:56,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:56,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:56,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:56,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:56,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:56,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:56,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:56,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:56,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:56,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:58,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:58,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:29:58,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:58,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:29:58,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:29:58,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:29:58,914 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 17:29:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:59,008 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 17:29:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:29:59,009 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 17:29:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:59,010 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:29:59,010 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:29:59,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:29:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:29:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:29:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:29:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 17:29:59,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 17:29:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:59,012 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 17:29:59,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:29:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 17:29:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:29:59,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:59,013 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 17:29:59,013 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:59,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-03 17:29:59,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:59,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:00,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:00,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:00,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:00,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:00,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:00,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:00,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:00,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:30:00,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:00,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:00,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:03,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:30:03,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:03,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:30:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:30:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:30:03,341 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 17:30:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:03,405 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 17:30:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:30:03,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 17:30:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:03,406 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:30:03,407 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:30:03,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:30:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:30:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:30:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:30:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 17:30:03,409 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 17:30:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:03,410 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 17:30:03,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:30:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 17:30:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:30:03,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:03,410 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 17:30:03,411 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:03,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-03 17:30:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:03,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:03,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:03,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:03,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:04,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:04,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:04,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:04,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:04,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:04,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:04,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:04,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:04,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:04,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:04,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:04,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:07,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:30:07,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:07,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:30:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:30:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:30:07,493 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 17:30:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:07,644 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 17:30:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:30:07,644 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 17:30:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:07,645 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:30:07,645 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:30:07,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:30:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:30:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:30:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:30:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 17:30:07,648 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 17:30:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:07,648 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 17:30:07,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:30:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 17:30:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:30:07,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:07,649 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 17:30:07,649 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:07,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-03 17:30:07,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:07,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:07,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:08,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:08,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:08,590 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:08,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:08,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:08,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:08,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:08,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:08,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:11,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:11,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:30:11,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:11,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:30:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:30:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:30:11,850 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 17:30:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:11,911 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 17:30:11,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:30:11,911 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 17:30:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:11,912 INFO L225 Difference]: With dead ends: 56 [2018-12-03 17:30:11,912 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:30:11,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:30:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:30:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:30:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:30:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 17:30:11,915 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 17:30:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:11,915 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 17:30:11,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:30:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 17:30:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:30:11,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:11,916 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 17:30:11,916 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:11,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-03 17:30:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:11,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:12,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:12,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:12,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:12,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:12,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:12,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:12,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:12,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:13,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:30:13,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:13,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:13,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:16,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:16,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:30:16,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:16,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:30:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:30:16,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:30:16,449 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 17:30:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:16,638 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 17:30:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:30:16,639 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 17:30:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:16,640 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:30:16,640 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:30:16,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:30:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:30:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 17:30:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:30:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 17:30:16,643 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 17:30:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:16,643 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 17:30:16,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:30:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 17:30:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:30:16,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:16,644 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 17:30:16,644 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:16,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-03 17:30:16,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:16,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:16,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:17,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:17,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:17,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:17,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:17,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:17,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:17,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:17,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:17,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:17,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:17,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:17,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:20,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:20,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:30:20,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:20,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:30:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:30:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:30:20,988 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 17:30:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:21,089 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 17:30:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:30:21,089 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 17:30:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:21,090 INFO L225 Difference]: With dead ends: 58 [2018-12-03 17:30:21,090 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 17:30:21,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:30:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 17:30:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 17:30:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:30:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 17:30:21,093 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 17:30:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:21,094 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 17:30:21,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:30:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 17:30:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:30:21,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:21,095 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 17:30:21,095 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:21,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:21,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-03 17:30:21,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:21,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:21,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:22,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:22,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:22,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:22,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:22,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:22,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:22,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:22,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:22,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:25,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:25,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:30:25,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:25,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:30:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:30:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:30:25,570 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 17:30:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:25,697 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 17:30:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:30:25,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 17:30:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:25,698 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:30:25,698 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:30:25,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:30:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:30:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 17:30:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:30:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 17:30:25,701 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 17:30:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:25,701 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 17:30:25,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:30:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 17:30:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:30:25,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:25,702 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 17:30:25,702 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:25,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:25,702 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-03 17:30:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:25,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:25,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:26,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:26,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:26,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:26,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:26,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:26,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:26,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:26,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:27,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:30:27,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:27,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:27,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:30,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:30,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:30:30,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:30,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:30:30,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:30:30,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:30:30,322 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 17:30:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:30,404 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 17:30:30,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:30:30,405 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 17:30:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:30,405 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:30:30,405 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:30:30,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:30:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:30:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:30:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:30:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 17:30:30,408 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 17:30:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 17:30:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:30:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 17:30:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:30:30,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:30,408 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 17:30:30,409 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:30,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-03 17:30:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:30,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:30,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:30,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:30,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:31,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:31,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:31,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:31,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:31,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:31,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:31,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:31,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:31,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:31,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:34,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:34,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:30:34,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:34,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:30:34,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:30:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:30:34,970 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 17:30:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:35,066 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 17:30:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:30:35,066 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 17:30:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:35,067 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:30:35,067 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:30:35,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:30:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:30:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:30:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:30:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 17:30:35,069 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 17:30:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:35,070 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 17:30:35,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:30:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 17:30:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:30:35,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:35,070 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 17:30:35,071 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:35,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-03 17:30:35,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:35,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:35,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:36,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:36,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:36,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:36,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:36,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:36,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:36,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:36,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:40,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:40,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:30:40,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:40,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:30:40,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:30:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:30:40,270 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 17:30:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:40,387 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 17:30:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:30:40,388 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 17:30:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:40,388 INFO L225 Difference]: With dead ends: 62 [2018-12-03 17:30:40,388 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:30:40,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:30:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:30:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:30:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:30:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 17:30:40,394 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 17:30:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:40,394 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 17:30:40,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:30:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 17:30:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:30:40,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:40,395 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 17:30:40,395 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:40,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-03 17:30:40,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:40,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:40,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:42,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:42,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:42,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:42,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:42,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:42,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:42,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:42,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:42,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:30:42,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:42,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:42,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:46,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:46,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:30:46,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:46,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:30:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:30:46,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:30:46,648 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 17:30:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:46,724 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 17:30:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:30:46,724 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 17:30:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:46,725 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:30:46,725 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:30:46,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:30:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:30:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:30:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:30:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 17:30:46,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 17:30:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:46,730 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 17:30:46,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:30:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 17:30:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:30:46,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:46,731 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 17:30:46,731 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:46,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-03 17:30:46,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:46,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:46,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:48,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:48,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:48,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:48,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:48,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:48,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:48,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:48,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:48,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:48,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:48,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:52,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:52,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:30:52,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:52,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:30:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:30:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:30:52,490 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 17:30:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:52,616 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 17:30:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:30:52,617 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 17:30:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:52,617 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:30:52,617 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:30:52,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:30:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:30:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 17:30:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:30:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 17:30:52,620 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 17:30:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:52,620 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 17:30:52,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:30:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 17:30:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:30:52,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:52,621 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 17:30:52,621 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:52,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-03 17:30:52,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:52,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:52,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:52,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:54,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:54,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:54,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:54,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:54,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:54,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:54,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:54,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:54,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:54,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:58,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:58,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:30:58,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:58,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:30:58,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:30:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:30:58,470 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 17:30:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:58,562 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 17:30:58,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:30:58,562 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 17:30:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:58,563 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:30:58,563 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:30:58,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:30:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:30:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:30:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:30:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 17:30:58,568 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 17:30:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:58,568 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 17:30:58,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:30:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 17:30:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:30:58,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:58,568 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 17:30:58,568 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:58,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-03 17:30:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:58,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:58,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:00,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:00,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:00,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:00,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:00,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:00,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:00,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:00,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:00,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:31:00,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:00,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:00,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:04,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:04,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:31:04,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:04,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:31:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:31:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:31:04,605 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 17:31:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:04,688 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 17:31:04,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:31:04,688 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 17:31:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:04,689 INFO L225 Difference]: With dead ends: 66 [2018-12-03 17:31:04,689 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 17:31:04,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:31:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 17:31:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 17:31:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:31:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 17:31:04,693 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 17:31:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:04,693 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 17:31:04,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:31:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 17:31:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:31:04,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:04,693 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 17:31:04,694 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:04,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-03 17:31:04,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:04,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:04,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:04,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:06,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:06,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:06,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:06,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:06,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:06,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:06,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:06,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:06,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:06,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:06,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:10,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:10,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:31:10,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:10,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:31:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:31:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:31:10,308 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 17:31:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:10,449 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 17:31:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:31:10,449 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 17:31:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:10,450 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:31:10,450 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:31:10,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:31:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:31:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:31:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:31:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 17:31:10,453 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 17:31:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:10,453 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 17:31:10,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:31:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 17:31:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:31:10,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:10,454 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 17:31:10,454 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:10,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:10,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-03 17:31:10,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:10,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:10,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:12,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:12,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:12,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:12,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:12,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:12,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:12,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:12,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:12,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:12,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:31:16,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:16,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:31:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:31:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:31:16,335 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 17:31:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:16,490 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 17:31:16,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:31:16,490 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 17:31:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:16,491 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:31:16,491 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:31:16,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:31:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:31:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:31:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:31:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 17:31:16,494 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 17:31:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:16,494 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 17:31:16,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:31:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 17:31:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:31:16,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:16,495 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 17:31:16,495 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:16,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-03 17:31:16,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:16,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:18,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:18,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:18,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:18,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:18,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:18,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:18,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:18,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:18,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:31:18,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:18,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:18,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:23,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:23,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:31:23,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:23,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:31:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:31:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:31:23,200 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 17:31:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:23,318 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 17:31:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:31:23,318 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 17:31:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:23,319 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:31:23,319 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:31:23,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:31:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:31:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:31:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:31:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 17:31:23,323 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 17:31:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:23,323 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 17:31:23,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:31:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 17:31:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:31:23,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:23,324 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 17:31:23,324 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:23,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:23,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-03 17:31:23,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:23,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:23,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:24,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:24,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:24,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:24,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:24,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:24,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:24,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:24,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:24,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:24,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:24,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:29,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:29,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:31:29,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:29,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:31:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:31:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:31:29,648 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 17:31:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:29,768 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 17:31:29,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:31:29,770 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 17:31:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:29,771 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:31:29,771 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:31:29,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:31:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:31:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:31:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:31:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 17:31:29,777 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 17:31:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:29,779 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 17:31:29,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:31:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 17:31:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:31:29,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:29,780 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 17:31:29,780 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:29,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-03 17:31:29,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:29,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:29,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:31,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:31,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:31,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:31,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:31,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:31,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:31,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:31,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:31,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:31,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:36,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:36,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:31:36,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:36,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:31:36,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:31:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:31:36,393 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 17:31:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:36,484 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 17:31:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:31:36,484 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 17:31:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:36,485 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:31:36,485 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:31:36,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:31:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:31:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:31:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:31:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 17:31:36,489 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 17:31:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:36,490 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 17:31:36,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:31:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 17:31:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:31:36,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:36,491 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 17:31:36,491 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:36,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-03 17:31:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:38,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:38,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:38,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:38,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:38,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:38,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:38,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:38,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:39,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:31:39,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:39,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:39,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:44,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:44,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:31:44,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:44,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:31:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:31:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:31:44,092 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 17:31:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:44,197 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 17:31:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:31:44,198 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 17:31:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:44,198 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:31:44,198 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 17:31:44,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:31:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 17:31:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 17:31:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:31:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 17:31:44,202 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 17:31:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:44,202 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 17:31:44,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:31:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 17:31:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:31:44,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:44,203 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 17:31:44,203 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:44,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-03 17:31:44,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:44,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:44,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:46,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:46,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:46,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:46,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:46,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:46,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:46,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:46,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:46,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:46,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:46,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:46,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:31:52,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:52,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:31:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:31:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:31:52,911 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 17:31:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:53,268 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 17:31:53,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:31:53,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 17:31:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:53,269 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:31:53,269 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:31:53,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:31:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:31:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 17:31:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 17:31:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 17:31:53,271 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 17:31:53,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:53,271 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 17:31:53,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:31:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 17:31:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:31:53,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:53,272 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 17:31:53,272 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:53,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-03 17:31:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:53,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:53,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:54,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:54,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:54,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:54,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:54,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:55,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:55,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:00,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:00,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:32:00,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:00,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:32:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:32:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:32:00,456 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 17:32:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:00,556 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 17:32:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:32:00,557 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 17:32:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:00,558 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:32:00,558 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 17:32:00,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:32:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 17:32:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 17:32:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:32:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 17:32:00,562 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 17:32:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:00,562 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 17:32:00,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:32:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 17:32:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:32:00,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:00,563 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 17:32:00,563 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:00,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-03 17:32:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:00,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:02,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:02,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:02,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:02,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:02,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:02,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:02,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:02,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:03,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:32:03,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:03,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:03,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:08,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:08,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:32:08,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:08,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:32:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:32:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:32:08,435 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 17:32:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:08,662 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 17:32:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:32:08,663 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 17:32:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:08,663 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:32:08,663 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:32:08,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:32:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:32:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 17:32:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:32:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 17:32:08,666 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 17:32:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:08,666 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 17:32:08,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:32:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 17:32:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:32:08,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:08,667 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 17:32:08,667 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:08,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-03 17:32:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:08,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:08,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:10,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:10,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:10,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:10,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:10,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:10,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:10,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:10,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:10,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:10,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:10,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:16,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:32:16,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:16,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:32:16,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:32:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:32:16,066 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 17:32:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:16,196 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 17:32:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:32:16,197 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 17:32:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:16,197 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:32:16,197 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:32:16,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:32:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:32:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:32:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:32:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 17:32:16,201 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 17:32:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:16,201 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 17:32:16,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:32:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 17:32:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:32:16,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:16,202 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 17:32:16,202 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:16,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-03 17:32:16,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:16,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:16,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:16,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:18,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:18,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:18,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:18,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:18,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:18,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:18,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:18,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:24,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:24,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:32:24,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:24,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:32:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:32:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:32:24,487 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 17:32:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:24,652 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 17:32:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:32:24,652 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 17:32:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:24,653 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:32:24,653 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:32:24,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:32:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:32:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:32:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:32:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 17:32:24,658 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 17:32:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:24,658 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 17:32:24,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:32:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 17:32:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:32:24,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:24,659 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 17:32:24,659 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:24,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-03 17:32:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:24,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:24,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:26,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:26,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:26,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:26,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:26,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:26,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:26,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:27,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:32:27,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:27,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:27,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:32:32,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:32,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:32:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:32:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:32:32,876 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 17:32:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:33,039 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 17:32:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:32:33,039 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 17:32:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:33,040 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:32:33,040 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:32:33,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:32:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:32:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:32:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:32:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 17:32:33,044 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 17:32:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:33,044 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 17:32:33,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:32:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 17:32:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:32:33,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:33,045 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 17:32:33,045 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:33,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-03 17:32:33,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:33,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:33,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:33,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:35,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:35,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:35,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:35,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:35,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:35,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:35,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:35,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:35,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:35,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:35,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:35,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:41,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:41,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:32:41,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:41,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:32:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:32:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:32:41,574 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 17:32:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:41,740 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 17:32:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:32:41,740 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 17:32:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:41,741 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:32:41,741 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:32:41,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:32:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:32:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:32:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:32:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 17:32:41,744 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 17:32:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:41,744 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 17:32:41,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:32:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 17:32:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:32:41,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:41,745 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 17:32:41,745 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:41,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-03 17:32:41,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:41,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:41,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:43,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:43,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:43,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:43,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:43,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:43,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:43,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:43,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:44,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:44,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:50,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:50,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:32:50,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:50,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:32:50,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:32:50,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:32:50,149 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 17:32:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:50,297 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 17:32:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:32:50,298 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 17:32:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:50,298 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:32:50,298 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 17:32:50,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:32:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 17:32:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 17:32:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:32:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 17:32:50,301 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 17:32:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:50,301 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 17:32:50,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:32:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 17:32:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:32:50,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:50,302 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 17:32:50,302 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:50,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-03 17:32:50,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:50,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:50,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:52,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:52,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:52,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:52,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:52,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:52,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:52,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:52,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:53,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:32:53,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:53,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:53,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:32:59,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:59,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:32:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:32:59,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:32:59,487 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 17:32:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:59,599 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 17:32:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:32:59,599 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 17:32:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:59,600 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:32:59,600 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:32:59,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:32:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:32:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 17:32:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:32:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 17:32:59,605 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 17:32:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:59,605 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 17:32:59,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:32:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 17:32:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:32:59,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:59,606 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 17:32:59,606 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:59,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-03 17:32:59,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:59,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:59,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:01,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:01,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:01,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:01,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:01,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:01,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:01,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:01,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:01,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:01,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:01,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:01,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:08,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:08,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:33:08,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:08,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:33:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:33:08,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:33:08,221 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 17:33:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:08,366 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 17:33:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:33:08,367 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 17:33:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:08,367 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:33:08,367 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:33:08,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:33:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:33:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:33:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:33:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 17:33:08,371 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 17:33:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:08,371 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 17:33:08,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:33:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 17:33:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:33:08,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:08,371 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 17:33:08,372 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:08,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-03 17:33:08,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:08,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:08,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:10,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:10,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:10,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:10,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:10,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:10,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:10,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:10,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:10,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:10,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:17,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:17,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:33:17,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:17,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:33:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:33:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:33:17,383 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 17:33:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:17,905 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 17:33:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:33:17,905 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 17:33:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:17,906 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:33:17,906 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:33:17,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:33:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:33:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:33:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:33:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 17:33:17,909 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 17:33:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:17,909 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 17:33:17,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:33:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 17:33:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:33:17,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:17,909 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 17:33:17,910 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-03 17:33:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:17,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:17,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:17,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:17,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:20,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:20,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:20,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:20,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:20,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:20,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:20,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:21,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:33:21,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:21,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:21,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:28,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:28,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:33:28,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:28,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:33:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:33:28,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:33:28,290 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 17:33:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:28,889 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 17:33:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:33:28,890 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 17:33:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:28,890 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:33:28,890 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:33:28,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:33:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:33:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:33:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:33:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 17:33:28,894 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 17:33:28,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:28,895 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 17:33:28,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:33:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 17:33:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:33:28,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:28,896 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 17:33:28,896 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:28,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-03 17:33:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:28,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:28,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:31,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:31,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:31,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:31,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:31,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:31,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:31,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:31,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:31,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:31,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:31,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:31,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:38,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:38,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:33:38,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:38,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:33:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:33:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:33:38,692 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 17:33:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:38,846 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 17:33:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:33:38,846 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 17:33:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:38,846 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:33:38,847 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:33:38,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:33:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:33:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:33:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:33:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 17:33:38,850 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 17:33:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:38,850 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 17:33:38,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:33:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 17:33:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:33:38,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:38,851 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 17:33:38,851 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:38,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-03 17:33:38,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:38,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:38,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:38,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:38,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:41,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:41,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:41,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:41,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:41,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:41,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:41,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:41,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:41,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:41,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:49,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:49,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:33:49,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:49,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:33:49,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:33:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:33:49,273 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 17:33:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:49,395 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 17:33:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:33:49,395 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 17:33:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:49,396 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:33:49,397 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:33:49,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:33:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:33:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:33:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:33:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 17:33:49,401 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 17:33:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:49,401 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 17:33:49,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:33:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 17:33:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:33:49,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:49,401 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 17:33:49,402 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:49,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-03 17:33:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:49,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:52,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:52,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:52,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:52,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:52,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:52,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:52,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:53,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 17:33:53,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:53,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:53,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:00,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:00,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:34:00,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:00,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:34:00,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:34:00,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:34:00,300 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 17:34:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:00,539 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 17:34:00,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:34:00,539 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 17:34:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:00,540 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:34:00,540 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:34:00,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:34:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:34:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:34:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:34:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 17:34:00,543 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 17:34:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:00,543 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 17:34:00,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:34:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 17:34:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:34:00,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:00,543 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 17:34:00,544 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:00,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:00,544 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-03 17:34:00,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:00,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:00,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:03,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:03,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:03,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:03,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:03,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:03,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:03,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:03,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:03,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:03,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:10,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:10,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:34:10,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:10,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:34:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:34:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:34:10,538 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 17:34:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:10,798 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 17:34:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:34:10,798 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 17:34:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:10,799 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:34:10,799 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:34:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:34:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:34:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:34:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:34:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 17:34:10,802 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 17:34:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:10,802 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 17:34:10,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:34:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 17:34:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:34:10,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:10,802 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 17:34:10,802 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:10,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-03 17:34:10,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:10,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:10,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:13,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:13,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:13,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:13,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:13,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:13,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:13,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:13,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:13,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:20,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:20,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:34:20,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:20,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:34:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:34:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:34:20,992 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 17:34:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:21,280 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 17:34:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:34:21,280 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 17:34:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:21,281 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:34:21,281 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:34:21,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:34:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:34:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:34:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:34:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 17:34:21,284 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 17:34:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:21,284 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 17:34:21,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:34:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 17:34:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:34:21,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:21,285 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 17:34:21,285 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:21,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:21,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-03 17:34:21,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:21,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:21,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:23,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:23,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:23,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:23,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:23,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:23,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:23,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:24,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 17:34:24,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:24,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:24,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:33,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:33,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:34:33,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:33,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:34:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:34:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:34:33,055 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 17:34:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:33,201 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 17:34:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:34:33,201 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 17:34:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:33,202 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:34:33,202 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:34:33,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:34:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:34:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:34:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:34:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 17:34:33,206 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 17:34:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:33,206 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 17:34:33,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:34:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 17:34:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:34:33,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:33,207 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 17:34:33,207 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:33,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-03 17:34:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:33,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:33,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:35,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:35,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:35,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:35,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:35,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:35,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:35,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:35,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:35,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:35,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:35,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:35,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:44,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:44,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:34:44,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:44,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:34:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:34:44,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:34:44,071 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 17:34:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:44,227 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 17:34:44,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:34:44,228 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 17:34:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:44,228 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:34:44,228 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:34:44,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:34:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:34:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:34:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:34:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 17:34:44,232 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 17:34:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:44,232 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 17:34:44,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:34:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 17:34:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:34:44,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:44,233 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 17:34:44,233 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:44,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:44,234 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-03 17:34:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:44,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:44,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:44,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:47,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:47,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:47,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:47,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:47,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:47,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:47,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:47,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:47,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:55,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:55,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:34:55,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:55,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:34:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:34:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:34:55,272 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 17:34:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:55,632 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 17:34:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:34:55,633 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 17:34:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:55,633 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:34:55,634 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:34:55,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:34:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:34:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:34:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:34:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 17:34:55,636 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 17:34:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:55,637 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 17:34:55,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:34:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 17:34:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:34:55,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:55,638 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 17:34:55,638 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:55,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-03 17:34:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:55,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:55,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:58,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:58,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:58,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:58,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:58,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:58,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:58,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:58,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:59,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:34:59,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:59,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:00,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:08,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:08,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:35:08,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:08,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:35:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:35:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:35:08,467 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 17:35:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:08,688 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 17:35:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:35:08,688 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 17:35:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:08,689 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:35:08,689 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:35:08,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:35:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:35:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:35:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:35:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 17:35:08,692 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 17:35:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:08,692 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 17:35:08,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:35:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 17:35:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:35:08,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:08,692 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 17:35:08,692 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:08,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-03 17:35:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:08,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:08,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:11,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:11,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:11,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:11,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:11,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:11,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:11,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:11,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:11,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:11,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:11,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:20,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:20,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:35:20,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:20,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:35:20,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:35:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:35:20,468 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 17:35:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:20,609 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 17:35:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:35:20,610 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 17:35:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:20,611 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:35:20,611 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:35:20,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:35:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:35:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:35:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:35:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 17:35:20,614 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 17:35:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:20,614 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 17:35:20,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:35:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 17:35:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:35:20,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:20,614 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 17:35:20,615 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:20,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-03 17:35:20,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:20,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:20,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:23,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:23,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:23,785 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:23,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:23,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:23,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:23,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:23,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:23,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:23,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:32,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:32,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:35:32,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:32,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:35:32,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:35:32,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:35:32,575 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 17:35:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:32,850 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 17:35:32,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:35:32,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 17:35:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:32,851 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:35:32,851 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:35:32,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:35:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:35:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:35:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:35:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 17:35:32,854 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 17:35:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:32,854 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 17:35:32,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:35:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 17:35:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:35:32,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:32,855 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 17:35:32,855 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:32,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-03 17:35:32,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:32,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:32,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:35,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:35,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:35,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:35,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:35,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:35,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:35,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:37,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:35:37,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:37,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:37,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:46,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:46,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:35:46,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:46,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:35:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:35:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:35:46,056 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 17:35:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:46,202 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 17:35:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:35:46,203 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 17:35:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:46,203 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:35:46,203 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:35:46,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:35:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:35:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:35:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:35:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 17:35:46,206 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 17:35:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:46,207 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 17:35:46,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:35:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 17:35:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:35:46,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:46,207 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 17:35:46,207 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:46,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-03 17:35:46,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:46,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:46,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:49,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:49,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:49,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:49,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:49,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:49,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:49,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:49,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:49,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:49,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:49,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:49,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:58,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:58,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:35:58,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:58,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:35:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:35:58,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:35:58,998 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 17:35:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:59,247 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 17:35:59,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:35:59,247 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 17:35:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:59,247 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:35:59,248 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:35:59,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:35:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:35:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:35:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:35:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 17:35:59,251 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 17:35:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:59,251 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 17:35:59,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:35:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 17:35:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:35:59,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:59,252 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 17:35:59,252 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:59,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-03 17:35:59,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:59,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:59,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:59,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:02,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:02,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:02,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:02,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:02,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:02,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:02,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:02,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:02,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:02,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:11,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:11,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:36:11,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:11,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:36:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:36:11,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:36:11,866 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 17:36:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:12,062 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 17:36:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:36:12,063 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 17:36:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:12,063 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:36:12,063 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:36:12,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:36:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:36:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:36:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:36:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 17:36:12,066 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 17:36:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:12,066 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 17:36:12,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:36:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 17:36:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:36:12,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:12,067 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 17:36:12,067 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:12,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-03 17:36:12,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:12,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:12,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:15,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:15,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:15,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:15,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:15,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:15,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:15,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:15,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:17,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 17:36:17,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:17,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:17,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:26,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:26,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:36:26,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:26,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:36:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:36:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:36:26,895 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 17:36:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:27,052 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 17:36:27,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:36:27,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 17:36:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:27,053 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:36:27,053 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:36:27,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:36:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:36:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:36:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:36:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 17:36:27,057 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 17:36:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:27,057 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 17:36:27,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:36:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 17:36:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:36:27,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:27,058 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 17:36:27,058 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:27,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-03 17:36:27,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:27,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:27,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:27,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:27,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:30,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:30,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:30,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:30,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:30,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:30,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:30,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:30,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:30,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:30,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:40,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:40,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:36:40,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:40,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:36:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:36:40,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:36:40,306 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 17:36:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:40,453 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 17:36:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:36:40,453 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 17:36:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:40,454 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:36:40,454 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:36:40,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:36:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:36:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:36:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:36:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 17:36:40,457 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 17:36:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:40,457 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 17:36:40,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:36:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 17:36:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:36:40,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:40,458 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 17:36:40,458 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:40,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-03 17:36:40,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:40,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:40,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:43,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:43,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:43,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:43,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:43,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:43,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:43,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:43,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:43,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:43,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:53,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:53,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:36:53,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:53,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:36:53,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:36:53,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:36:53,852 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 17:36:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:54,005 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 17:36:54,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:36:54,006 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 17:36:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:54,006 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:36:54,007 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:36:54,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:36:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:36:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:36:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:36:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 17:36:54,010 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 17:36:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:54,011 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 17:36:54,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:36:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 17:36:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:36:54,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:54,011 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 17:36:54,012 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:54,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-03 17:36:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:54,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:54,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:57,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:57,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:57,596 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:57,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:57,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:57,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:57,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:57,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:59,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 17:36:59,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:59,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:59,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:09,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:09,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:37:09,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:09,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:37:09,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:37:09,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:37:09,525 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 17:37:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:09,693 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 17:37:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:37:09,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 17:37:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:09,694 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:37:09,694 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:37:09,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:37:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:37:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:37:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:37:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 17:37:09,698 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 17:37:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:09,698 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 17:37:09,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:37:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 17:37:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:37:09,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:09,699 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 17:37:09,699 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:09,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-03 17:37:09,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:09,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:09,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:13,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:13,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:13,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:13,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:13,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:13,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:13,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:13,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:13,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:13,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:13,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:37:24,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:24,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:37:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:37:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:37:24,007 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 17:37:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:24,222 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 17:37:24,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:37:24,222 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 17:37:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:24,223 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:37:24,223 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:37:24,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:37:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:37:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:37:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:37:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 17:37:24,226 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 17:37:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:24,226 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 17:37:24,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:37:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 17:37:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:37:24,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:24,226 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 17:37:24,227 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:24,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-03 17:37:24,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:24,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:24,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:28,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:28,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:28,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:28,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:28,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:28,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:28,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:28,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:38,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:37:38,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:38,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:37:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:37:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:37:38,929 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 17:37:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:39,238 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 17:37:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:37:39,238 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 17:37:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:39,239 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:37:39,239 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:37:39,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:37:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:37:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:37:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:37:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 17:37:39,243 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 17:37:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:39,243 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 17:37:39,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:37:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 17:37:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:37:39,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:39,244 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 17:37:39,244 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:39,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-03 17:37:39,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:39,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:39,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:39,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:39,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:43,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:43,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:43,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:43,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:43,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:43,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:43,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:43,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:45,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:37:45,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:45,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:45,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:56,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:56,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:37:56,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:56,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:37:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:37:56,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:37:56,358 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 17:37:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:56,602 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 17:37:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:37:56,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 17:37:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:56,603 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:37:56,603 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:37:56,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:37:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:37:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:37:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:37:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 17:37:56,606 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 17:37:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:56,606 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 17:37:56,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:37:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 17:37:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:37:56,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:56,607 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 17:37:56,607 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-03 17:37:56,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:56,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:56,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:00,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:00,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:00,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:00,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:00,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:00,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:00,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:00,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:00,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:00,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:00,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:00,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:11,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:11,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:38:11,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:11,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:38:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:38:11,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:38:11,823 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 17:38:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:12,090 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 17:38:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:38:12,090 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 17:38:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:12,091 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:38:12,091 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:38:12,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:38:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:38:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:38:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:38:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 17:38:12,095 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 17:38:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:12,095 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 17:38:12,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:38:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 17:38:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:38:12,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:12,096 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 17:38:12,096 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:12,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-03 17:38:12,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:12,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:12,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:15,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:15,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:15,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:15,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:15,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:15,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:15,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:15,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:15,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:15,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:27,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:27,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:38:27,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:38:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:38:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:38:27,442 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 17:38:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:27,630 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 17:38:27,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:38:27,631 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 17:38:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:27,631 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:38:27,632 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:38:27,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:38:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:38:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:38:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:38:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 17:38:27,636 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 17:38:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:27,636 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 17:38:27,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:38:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 17:38:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:38:27,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:27,637 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 17:38:27,637 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:27,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-03 17:38:27,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:27,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:27,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:27,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:27,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:31,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:31,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:31,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:31,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:31,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:31,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:31,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:33,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:38:33,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:33,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:33,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:45,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:45,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:38:45,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:45,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:38:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:38:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:38:45,358 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 17:38:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:45,700 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 17:38:45,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:38:45,700 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 17:38:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:45,701 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:38:45,701 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:38:45,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:38:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:38:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:38:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:38:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 17:38:45,706 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 17:38:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:45,706 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 17:38:45,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:38:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 17:38:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:38:45,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:45,707 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 17:38:45,707 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:45,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-03 17:38:45,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:45,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:45,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:49,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:49,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:49,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:49,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:49,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:49,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:49,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:50,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:50,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:50,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:50,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:01,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:39:01,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:01,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:39:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:39:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:39:01,841 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 17:39:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:02,158 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 17:39:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:39:02,158 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 17:39:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:02,159 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:39:02,159 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:39:02,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:39:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:39:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:39:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:39:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 17:39:02,163 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 17:39:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:02,163 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 17:39:02,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:39:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 17:39:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:39:02,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:02,164 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 17:39:02,164 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:02,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:02,164 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-03 17:39:02,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:02,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:02,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:02,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:02,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:06,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:06,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:06,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:06,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:06,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:06,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:06,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:39:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:06,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:06,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:18,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:18,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:39:18,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:18,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:39:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:39:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:39:18,732 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 17:39:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:18,968 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 17:39:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:39:18,968 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 17:39:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:18,969 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:39:18,969 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:39:18,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:39:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:39:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:39:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:39:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 17:39:18,973 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 17:39:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:18,973 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 17:39:18,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:39:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 17:39:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:39:18,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:18,974 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 17:39:18,975 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:18,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:18,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-03 17:39:18,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:22,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:22,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:22,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:22,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:22,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:22,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:22,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:39:22,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:39:25,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 17:39:25,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:25,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:25,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:39:37,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:39:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:39:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:39:37,460 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 17:39:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:37,704 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 17:39:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:39:37,705 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 17:39:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:37,705 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:39:37,705 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:39:37,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:39:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:39:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:39:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:39:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 17:39:37,708 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 17:39:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:37,708 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 17:39:37,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:39:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 17:39:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:39:37,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:37,709 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 17:39:37,709 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:37,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-03 17:39:37,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:37,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:37,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:37,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:37,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:41,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:41,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:41,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:41,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:41,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:41,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:41,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:39:41,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:39:42,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:39:42,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:42,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:42,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:54,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:54,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:39:54,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:54,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:39:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:39:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:39:54,637 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 17:39:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:54,928 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 17:39:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:39:54,929 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 17:39:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:54,929 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:39:54,929 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:39:54,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:39:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:39:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:39:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:39:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 17:39:54,932 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 17:39:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:54,932 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 17:39:54,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:39:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 17:39:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:39:54,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:54,933 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 17:39:54,933 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:54,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-03 17:39:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:54,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:54,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:59,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:59,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:59,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:59,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:59,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:59,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:59,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:39:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:59,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:40:12,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:12,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:40:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:40:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:40:12,032 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 17:40:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:12,303 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 17:40:12,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:40:12,304 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 17:40:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:12,304 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:40:12,304 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:40:12,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:40:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:40:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:40:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:40:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 17:40:12,308 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 17:40:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:12,308 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 17:40:12,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:40:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 17:40:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:40:12,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:12,309 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 17:40:12,309 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:12,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-03 17:40:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:12,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:12,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:16,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:16,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:16,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:16,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:16,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:16,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:16,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:16,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:19,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 17:40:19,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:19,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:19,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:32,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:32,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:40:32,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:32,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:40:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:40:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:40:32,589 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 17:40:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:32,942 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 17:40:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:40:32,942 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 17:40:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:32,942 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:40:32,943 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:40:32,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:40:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:40:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:40:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:40:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:40:32,946 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 17:40:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:32,946 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:40:32,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:40:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:40:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:40:32,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:32,946 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 17:40:32,947 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:32,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-03 17:40:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:37,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:37,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:37,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:37,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:37,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:37,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:37,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:37,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:37,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:37,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:37,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:37,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:51,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:51,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:40:51,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:51,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:40:51,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:40:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:40:51,010 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 17:40:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:51,272 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 17:40:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:40:51,272 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 17:40:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:51,273 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:40:51,273 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:40:51,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:40:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:40:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:40:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:40:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 17:40:51,277 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 17:40:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:51,277 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 17:40:51,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:40:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 17:40:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:40:51,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:51,278 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 17:40:51,279 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:51,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-03 17:40:51,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:51,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:51,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:51,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:55,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:55,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:55,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:55,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:55,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:55,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:55,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:55,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:55,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:55,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:09,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:09,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:41:09,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:09,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:41:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:41:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:41:09,096 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 17:41:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:09,339 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 17:41:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:41:09,340 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 17:41:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:09,340 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:41:09,340 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:41:09,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:41:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:41:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:41:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:41:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:41:09,346 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 17:41:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:09,346 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:41:09,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:41:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:41:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:41:09,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:09,347 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 17:41:09,347 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:09,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-03 17:41:09,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:09,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat