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/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:41:23,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:41:23,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:41:23,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:41:23,941 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:41:23,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:41:23,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:41:23,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:41:23,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:41:23,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:41:23,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:41:23,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:41:23,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:41:23,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:41:23,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:41:23,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:41:23,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:41:23,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:41:23,958 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:41:23,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:41:23,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:41:23,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:41:23,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:41:23,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:41:23,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:41:23,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:41:23,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:41:23,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:41:23,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:41:23,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:41:23,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:41:23,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:41:23,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:41:23,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:41:23,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:41:23,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:41:23,975 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:41:23,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:41:24,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:41:24,001 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:41:24,001 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:41:24,001 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:41:24,001 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:41:24,002 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:41:24,002 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:41:24,002 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:41:24,002 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:41:24,003 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:41:24,003 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:41:24,004 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:41:24,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:41:24,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:41:24,005 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:41:24,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:41:24,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:41:24,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:41:24,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:41:24,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:41:24,007 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:41:24,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:41:24,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:41:24,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:41:24,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:41:24,008 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:41:24,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:41:24,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:41:24,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:41:24,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:41:24,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:41:24,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:41:24,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:41:24,010 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:41:24,010 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:41:24,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:41:24,010 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:41:24,011 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:41:24,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:41:24,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:41:24,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:41:24,083 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:41:24,084 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:41:24,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2018-12-03 17:41:24,085 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-12-03 17:41:24,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:41:24,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:41:24,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:41:24,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:41:24,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:41:24,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:41:24,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:41:24,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:41:24,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:41:24,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/1) ... [2018-12-03 17:41:24,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:41:24,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:41:24,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:41:24,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:41:24,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (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:41:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:41:24,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:41:24,444 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:41:24,445 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:41:24,445 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:41:24 BoogieIcfgContainer [2018-12-03 17:41:24,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:41:24,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:41:24,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:41:24,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:41:24,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:41:24" (1/2) ... [2018-12-03 17:41:24,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fce94f and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:41:24, skipping insertion in model container [2018-12-03 17:41:24,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:41:24" (2/2) ... [2018-12-03 17:41:24,453 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-12-03 17:41:24,464 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:41:24,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:41:24,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:41:24,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:41:24,526 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:41:24,526 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:41:24,526 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:41:24,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:41:24,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:41:24,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:41:24,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:41:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 17:41:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:41:24,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:24,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:41:24,553 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:24,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:41:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:24,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:24,723 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:41:24,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:41:24,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:41:24,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:41:24,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:41:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:41:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:41:24,747 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 17:41:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:24,864 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 17:41:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:41:24,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:41:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:24,880 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:41:24,880 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:41:24,885 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:41:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:41:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:41:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:41:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 17:41:24,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2018-12-03 17:41:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:24,923 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 17:41:24,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:41:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 17:41:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:41:24,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:24,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:41:24,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28851306, now seen corresponding path program 1 times [2018-12-03 17:41:24,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:24,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:24,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:25,027 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:41:25,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:25,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:25,030 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 17:41:25,032 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14] [2018-12-03 17:41:25,103 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:41:25,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:41:25,397 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:41:25,399 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 16 times. Widened at 2 different actions 8 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:41:25,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:25,412 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:41:25,453 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-03 17:41:25,454 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:41:25,478 INFO L418 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-03 17:41:25,478 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:41:25,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:41:25,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-12-03 17:41:25,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:41:25,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:41:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:41:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:41:25,481 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-03 17:41:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:25,608 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 17:41:25,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:41:25,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 17:41:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:25,609 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:41:25,609 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:41:25,611 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 4 GetRequests, 3 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:41:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:41:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:41:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:41:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 17:41:25,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2018-12-03 17:41:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:25,617 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 17:41:25,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:41:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 17:41:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:41:25,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:25,618 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 17:41:25,619 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:25,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1956367763, now seen corresponding path program 1 times [2018-12-03 17:41:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:25,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:25,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:25,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:25,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:25,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:25,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:25,674 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 17:41:25,674 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14], [16] [2018-12-03 17:41:25,676 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:41:25,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:41:25,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:41:25,807 INFO L272 AbstractInterpreter]: Visited 6 different actions 46 times. Merged at 3 different actions 20 times. Widened at 3 different actions 12 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:41:25,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:25,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:41:25,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:25,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 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:41:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:25,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:25,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:25,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:26,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:26,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:41:26,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:26,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:41:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:41:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:41:26,042 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-12-03 17:41:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:26,094 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-03 17:41:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:41:26,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 17:41:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:26,095 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:41:26,095 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:41:26,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:41:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:41:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:41:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:41:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 17:41:26,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2018-12-03 17:41:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:26,107 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 17:41:26,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:41:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 17:41:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:41:26,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:26,110 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 17:41:26,111 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:26,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1128035974, now seen corresponding path program 2 times [2018-12-03 17:41:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:26,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:26,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:26,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:26,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:26,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:41:26,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:26,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 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:41:26,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:26,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:26,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:41:26,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:26,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:26,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:26,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:26,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 17:41:26,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:26,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:41:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:41:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:41:26,743 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 8 states. [2018-12-03 17:41:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:26,827 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2018-12-03 17:41:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:41:26,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:41:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:26,833 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:41:26,833 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:41:26,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:41:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:41:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-03 17:41:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:41:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-03 17:41:26,850 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2018-12-03 17:41:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:26,851 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-03 17:41:26,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:41:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-12-03 17:41:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:41:26,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:26,853 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 17:41:26,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:26,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1884090419, now seen corresponding path program 3 times [2018-12-03 17:41:26,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:26,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:26,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:26,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:26,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:27,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:27,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:27,029 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:41:27,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:27,030 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:41:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:27,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:27,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:27,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:27,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:27,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:41:27,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:27,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:41:27,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:41:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:41:27,178 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2018-12-03 17:41:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:27,228 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-03 17:41:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:41:27,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 17:41:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:27,230 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:41:27,230 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:41:27,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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:41:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:41:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:41:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:41:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 17:41:27,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-12-03 17:41:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:27,238 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 17:41:27,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:41:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 17:41:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:41:27,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:27,239 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 17:41:27,239 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:27,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1749669146, now seen corresponding path program 4 times [2018-12-03 17:41:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:27,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:27,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:27,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:27,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:27,315 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:41:27,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:27,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:41:27,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:27,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:27,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:27,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:41:27,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:27,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:41:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:41:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:41:27,769 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 7 states. [2018-12-03 17:41:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:27,856 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-03 17:41:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:41:27,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 17:41:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:27,858 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:41:27,859 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:41:27,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:41:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:41:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:41:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:41:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 17:41:27,867 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-12-03 17:41:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:27,867 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 17:41:27,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:41:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 17:41:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:41:27,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:27,868 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 17:41:27,868 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:27,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1419844673, now seen corresponding path program 5 times [2018-12-03 17:41:27,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:27,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:27,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:27,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:41:27,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:27,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:27,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:27,997 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:41:27,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:27,997 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:41:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:28,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:28,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:41:28,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:28,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 17:41:28,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 17:41:28,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 17:41:28,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:28,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:41:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:41:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:41:28,224 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2018-12-03 17:41:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:28,370 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-12-03 17:41:28,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:41:28,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 17:41:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:28,372 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:41:28,372 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:41:28,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 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:41:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:41:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 17:41:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:41:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-03 17:41:28,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-12-03 17:41:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:28,381 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 17:41:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:41:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-03 17:41:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:41:28,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:28,382 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 17:41:28,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:28,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2075300015, now seen corresponding path program 6 times [2018-12-03 17:41:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:28,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:28,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:28,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:28,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:28,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:28,567 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:41:28,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:28,567 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:41:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:28,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:28,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:28,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:28,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:28,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:28,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:28,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:41:28,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:28,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:41:28,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:41:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:41:28,823 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2018-12-03 17:41:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:28,918 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-12-03 17:41:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:41:28,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 17:41:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:28,925 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:41:28,925 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:41:28,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:41:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:41:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:41:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:41:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 17:41:28,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2018-12-03 17:41:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:28,934 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 17:41:28,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:41:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 17:41:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:41:28,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:28,936 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 17:41:28,936 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:28,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2095480120, now seen corresponding path program 7 times [2018-12-03 17:41:28,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:28,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:28,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:29,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:29,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:29,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:29,065 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:41:29,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:29,066 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:41:29,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:29,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:29,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:29,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:29,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:29,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:41:29,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:29,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:41:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:41:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:41:29,342 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 10 states. [2018-12-03 17:41:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:29,542 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-03 17:41:29,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:41:29,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 17:41:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:29,543 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:41:29,543 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:41:29,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:41:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:41:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:41:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:41:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 17:41:29,552 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2018-12-03 17:41:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:29,553 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 17:41:29,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:41:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 17:41:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:41:29,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:29,554 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 17:41:29,554 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:29,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1284264609, now seen corresponding path program 8 times [2018-12-03 17:41:29,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:29,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:29,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:41:29,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:29,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:29,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:29,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:41:29,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:29,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 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:41:29,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:29,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:29,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:41:29,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:29,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 17:41:29,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 17:41:29,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:29,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 17:41:29,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:29,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:41:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:41:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:41:29,985 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2018-12-03 17:41:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:30,360 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-03 17:41:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:41:30,361 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 17:41:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:30,362 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:41:30,363 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:41:30,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:41:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:41:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 17:41:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:41:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-03 17:41:30,373 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2018-12-03 17:41:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:30,373 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-03 17:41:30,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:41:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-03 17:41:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:41:30,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:30,374 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 17:41:30,375 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:30,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1943640559, now seen corresponding path program 9 times [2018-12-03 17:41:30,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:30,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:30,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:30,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:30,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:30,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:30,543 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:41:30,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:30,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 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:41:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:30,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:30,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:30,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:30,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:30,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:30,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:30,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:41:30,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:30,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:41:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:41:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:41:30,863 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 12 states. [2018-12-03 17:41:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:30,977 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-12-03 17:41:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:41:30,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 17:41:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:30,978 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:41:30,978 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:41:30,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:41:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:41:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 17:41:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:41:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 17:41:30,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2018-12-03 17:41:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:30,989 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 17:41:30,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:41:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 17:41:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:41:30,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:30,990 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 17:41:30,990 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:30,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 114675926, now seen corresponding path program 10 times [2018-12-03 17:41:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:30,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:30,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:31,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:31,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:31,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:31,252 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:41:31,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:31,252 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:41:31,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:31,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:31,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:31,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:31,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:31,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:41:31,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:31,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:41:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:41:31,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:41:31,818 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 13 states. [2018-12-03 17:41:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:31,874 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-03 17:41:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:41:31,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 17:41:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:31,876 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:41:31,877 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:41:31,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:41:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:41:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 17:41:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:41:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 17:41:31,888 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2018-12-03 17:41:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:31,888 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 17:41:31,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:41:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 17:41:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:41:31,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:31,890 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 17:41:31,890 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:31,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash -878712323, now seen corresponding path program 11 times [2018-12-03 17:41:31,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:31,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:31,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 17:41:32,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:32,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:32,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:32,112 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:41:32,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:32,112 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:41:32,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:32,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:32,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:41:32,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:32,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 17:41:32,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 17:41:32,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:32,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 17:41:32,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:32,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:41:32,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:41:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:41:32,719 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 20 states. [2018-12-03 17:41:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:32,899 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-12-03 17:41:32,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:41:32,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 17:41:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:32,901 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:41:32,901 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:41:32,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:41:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:41:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 17:41:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:41:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-03 17:41:32,913 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2018-12-03 17:41:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:32,913 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-03 17:41:32,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:41:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-03 17:41:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:41:32,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:32,915 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 17:41:32,915 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:32,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 361336845, now seen corresponding path program 12 times [2018-12-03 17:41:32,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:32,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:32,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:33,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:33,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:33,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:33,097 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:41:33,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:33,097 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:41:33,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:33,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:33,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:33,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:33,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:33,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:33,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:33,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:41:33,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:33,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:41:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:41:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:41:33,683 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 15 states. [2018-12-03 17:41:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:33,886 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-12-03 17:41:33,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:41:33,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 17:41:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:33,887 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:41:33,887 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:41:33,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:41:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:41:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:41:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:41:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 17:41:33,895 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2018-12-03 17:41:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:33,895 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 17:41:33,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:41:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 17:41:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:41:33,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:33,897 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 17:41:33,897 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:33,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 632287220, now seen corresponding path program 13 times [2018-12-03 17:41:33,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:33,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:33,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:33,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:33,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:34,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:34,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:34,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:34,219 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:41:34,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:34,219 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:41:34,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:34,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:34,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:34,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:34,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:34,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:41:34,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:34,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:41:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:41:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:41:34,556 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 16 states. [2018-12-03 17:41:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:34,617 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-03 17:41:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:41:34,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 17:41:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:34,618 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:41:34,619 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:41:34,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 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:41:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:41:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:41:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:41:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 17:41:34,627 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2018-12-03 17:41:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:34,627 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 17:41:34,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:41:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 17:41:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:41:34,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:34,628 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 17:41:34,629 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:34,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash -977407461, now seen corresponding path program 14 times [2018-12-03 17:41:34,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:34,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:34,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:34,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:34,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 17:41:34,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:34,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:34,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:34,810 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:41:34,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:34,810 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:41:34,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:34,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:34,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:41:34,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:34,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 17:41:34,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 17:41:35,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:35,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 17:41:35,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:35,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:41:35,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:41:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:41:35,135 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 24 states. [2018-12-03 17:41:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:35,254 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-12-03 17:41:35,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:41:35,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 17:41:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:35,256 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:41:35,256 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:41:35,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:41:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:41:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 17:41:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:41:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 17:41:35,267 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 43 [2018-12-03 17:41:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:35,267 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 17:41:35,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:41:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 17:41:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:41:35,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:35,268 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 17:41:35,269 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:35,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1433235883, now seen corresponding path program 15 times [2018-12-03 17:41:35,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:35,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:35,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:35,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:35,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:35,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:35,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:41:35,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:35,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 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:41:35,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:35,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:35,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:35,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:35,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:35,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:36,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:36,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:41:36,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:36,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:41:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:41:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:41:36,447 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 18 states. [2018-12-03 17:41:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:36,565 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-03 17:41:36,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:41:36,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 17:41:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:36,567 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:41:36,567 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:41:36,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:41:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:41:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:41:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:41:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 17:41:36,577 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 47 [2018-12-03 17:41:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:36,577 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 17:41:36,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:41:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 17:41:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:41:36,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:36,578 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 17:41:36,578 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:36,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 243595922, now seen corresponding path program 16 times [2018-12-03 17:41:36,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:36,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:36,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:36,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:36,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:36,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:36,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:36,975 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:41:36,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:36,976 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:41:36,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:36,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:37,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:37,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:37,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:37,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:41:37,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:37,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:41:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:41:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:41:37,898 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 19 states. [2018-12-03 17:41:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:37,982 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-03 17:41:37,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:41:37,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 17:41:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:37,983 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:41:37,983 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:41:37,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:41:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:41:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:41:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:41:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 17:41:37,994 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2018-12-03 17:41:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:37,994 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 17:41:37,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:41:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 17:41:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:41:37,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:37,995 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 17:41:37,996 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:37,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash -539105863, now seen corresponding path program 17 times [2018-12-03 17:41:37,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:37,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:37,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:41:38,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:38,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:38,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:38,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:41:38,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:38,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 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:41:38,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:38,295 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:38,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:41:38,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:38,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 17:41:39,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 17:41:39,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:39,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 17:41:39,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:39,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:41:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:41:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:41:39,412 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2018-12-03 17:41:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:39,723 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-12-03 17:41:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:41:39,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 17:41:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:39,724 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:41:39,724 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:41:39,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:41:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:41:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 17:41:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:41:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-03 17:41:39,734 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 51 [2018-12-03 17:41:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:39,735 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-03 17:41:39,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:41:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-12-03 17:41:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:41:39,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:39,736 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 17:41:39,736 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:39,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1223860535, now seen corresponding path program 18 times [2018-12-03 17:41:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:39,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:39,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:40,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:40,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:40,057 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:40,057 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:41:40,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:40,057 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:41:40,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:40,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:40,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:40,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:40,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:40,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:41:40,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:41:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:41:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:41:40,605 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 21 states. [2018-12-03 17:41:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:40,733 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-12-03 17:41:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:41:40,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 17:41:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:40,735 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:41:40,735 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:41:40,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:41:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:41:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:41:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:41:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 17:41:40,746 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 55 [2018-12-03 17:41:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:40,746 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 17:41:40,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:41:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 17:41:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:41:40,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:40,747 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 17:41:40,748 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1914892112, now seen corresponding path program 19 times [2018-12-03 17:41:40,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:40,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:40,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:41,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:41,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:41,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:41,099 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:41:41,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:41,099 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:41:41,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:41,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:41,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:41,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:41,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:41,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:41:41,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:41,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:41:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:41:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:41:41,874 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 22 states. [2018-12-03 17:41:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:41,946 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-12-03 17:41:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:41:41,946 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 17:41:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:41,947 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:41:41,947 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:41:41,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:41:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:41:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:41:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:41:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 17:41:41,958 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 57 [2018-12-03 17:41:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:41,958 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 17:41:41,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:41:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 17:41:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:41:41,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:41,959 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 17:41:41,959 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:41,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash -276306729, now seen corresponding path program 20 times [2018-12-03 17:41:41,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:41,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:41,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 17:41:42,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:42,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:42,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:42,208 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:41:42,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:42,208 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:41:42,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:42,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:42,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:41:42,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:42,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 17:41:42,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 17:41:42,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:42,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 17:41:42,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:42,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:41:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:41:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:41:42,700 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 32 states. [2018-12-03 17:41:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:42,857 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-03 17:41:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:41:42,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 17:41:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:42,862 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:41:42,862 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:41:42,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:41:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:41:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 17:41:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:41:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-03 17:41:42,872 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 59 [2018-12-03 17:41:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-03 17:41:42,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:41:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-03 17:41:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:41:42,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:42,873 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 17:41:42,873 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:42,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1466529639, now seen corresponding path program 21 times [2018-12-03 17:41:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:42,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:42,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:43,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:43,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:43,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:43,174 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:41:43,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:43,174 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:41:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:43,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:43,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:43,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:43,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:43,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:43,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:43,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:41:43,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:43,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:41:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:41:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:41:43,820 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 24 states. [2018-12-03 17:41:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:43,922 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-03 17:41:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:41:43,922 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 17:41:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:43,923 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:41:43,923 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:41:43,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:41:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:41:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:41:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:41:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 17:41:43,932 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 63 [2018-12-03 17:41:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:43,933 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 17:41:43,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:41:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 17:41:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:41:43,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:43,933 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 17:41:43,934 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:43,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash 163074638, now seen corresponding path program 22 times [2018-12-03 17:41:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:43,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:43,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:44,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:44,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:44,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:44,898 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:41:44,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:44,898 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:41:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:44,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:44,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:44,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:45,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:45,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:41:45,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:45,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:41:45,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:41:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:41:45,877 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 25 states. [2018-12-03 17:41:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:46,078 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-12-03 17:41:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:41:46,080 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 17:41:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:46,081 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:41:46,081 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:41:46,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:41:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:41:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:41:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:41:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 17:41:46,092 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 65 [2018-12-03 17:41:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:46,092 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 17:41:46,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:41:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 17:41:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:41:46,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:46,093 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 17:41:46,094 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:46,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1673269109, now seen corresponding path program 23 times [2018-12-03 17:41:46,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:46,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:46,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 17:41:46,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:46,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:46,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:46,591 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:41:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:46,591 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:41:46,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:46,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:46,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:41:46,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:46,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 17:41:46,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 17:41:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:47,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 17:41:47,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:47,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:41:47,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:41:47,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:41:47,186 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 36 states. [2018-12-03 17:41:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:47,335 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-12-03 17:41:47,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:41:47,335 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 17:41:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:47,336 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:41:47,337 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:41:47,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 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:41:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:41:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 17:41:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:41:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-12-03 17:41:47,348 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 67 [2018-12-03 17:41:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:47,348 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-12-03 17:41:47,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:41:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-12-03 17:41:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:41:47,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:47,349 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 17:41:47,349 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:47,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1861868421, now seen corresponding path program 24 times [2018-12-03 17:41:47,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:47,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:47,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:47,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:47,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:48,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:48,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:48,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:48,387 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:41:48,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:48,388 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:41:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:48,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:48,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:48,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:48,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:48,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:49,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:49,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:41:49,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:49,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:41:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:41:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:49,214 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 27 states. [2018-12-03 17:41:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:49,378 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2018-12-03 17:41:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:41:49,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 17:41:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:49,380 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:41:49,380 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:41:49,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:41:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:41:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:41:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 17:41:49,388 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 71 [2018-12-03 17:41:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:49,388 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 17:41:49,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:41:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 17:41:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:41:49,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:49,389 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 17:41:49,389 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:49,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 59694956, now seen corresponding path program 25 times [2018-12-03 17:41:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:49,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:49,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:49,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:49,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:49,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:49,875 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:41:49,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:49,875 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:41:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:49,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:49,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:49,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:51,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 17:41:51,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:51,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:41:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:41:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:51,050 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 28 states. [2018-12-03 17:41:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:51,312 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2018-12-03 17:41:51,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:41:51,313 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 17:41:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:51,314 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:41:51,314 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:41:51,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:41:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:41:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:41:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 17:41:51,322 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 73 [2018-12-03 17:41:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:51,322 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 17:41:51,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:41:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 17:41:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:41:51,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:51,323 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 17:41:51,324 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:51,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:51,324 INFO L82 PathProgramCache]: Analyzing trace with hash -957184621, now seen corresponding path program 26 times [2018-12-03 17:41:51,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:51,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:51,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:51,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:51,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 17:41:51,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:51,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:51,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:51,848 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:41:51,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:51,848 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:41:51,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:51,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:51,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:41:51,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:51,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 17:41:52,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 17:41:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:52,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 17:41:52,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:52,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:41:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:41:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:41:52,539 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 40 states. [2018-12-03 17:41:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:52,744 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-03 17:41:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:41:52,745 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 17:41:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:52,746 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:41:52,746 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:41:52,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:41:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:41:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 17:41:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:41:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-12-03 17:41:52,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 75 [2018-12-03 17:41:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:52,755 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-12-03 17:41:52,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:41:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-12-03 17:41:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:41:52,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:52,756 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 17:41:52,756 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:52,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1403956003, now seen corresponding path program 27 times [2018-12-03 17:41:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:52,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:52,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:53,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:53,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:53,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:53,119 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:41:53,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:53,119 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:41:53,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:53,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:53,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:53,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:53,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:53,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:53,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:53,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 17:41:53,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:53,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:41:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:41:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:53,923 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 30 states. [2018-12-03 17:41:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:54,039 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-12-03 17:41:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:41:54,040 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 17:41:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:54,041 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:41:54,041 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:41:54,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:41:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:41:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:41:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 17:41:54,052 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 79 [2018-12-03 17:41:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:54,052 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 17:41:54,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:41:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 17:41:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:41:54,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:54,053 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 17:41:54,054 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:54,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash 441505802, now seen corresponding path program 28 times [2018-12-03 17:41:54,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:54,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:54,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:54,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:54,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:54,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:54,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:54,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:54,737 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:41:54,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:54,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:54,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:54,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:56,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:56,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 17:41:56,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:56,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:41:56,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:41:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:56,084 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 31 states. [2018-12-03 17:41:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:56,218 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2018-12-03 17:41:56,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:41:56,219 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 17:41:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:56,220 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:41:56,220 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:41:56,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:41:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:41:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:41:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 17:41:56,232 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 81 [2018-12-03 17:41:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:56,232 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 17:41:56,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:41:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 17:41:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:41:56,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:56,233 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 17:41:56,233 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:56,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1055168719, now seen corresponding path program 29 times [2018-12-03 17:41:56,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:56,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:56,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:56,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:56,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 17:41:57,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:57,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:57,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:57,123 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:41:57,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:57,123 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:41:57,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:57,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:57,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 17:41:57,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:57,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 17:41:57,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 17:41:58,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:58,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 17:41:58,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:58,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:41:58,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:41:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:41:58,055 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 44 states. [2018-12-03 17:41:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:58,249 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-12-03 17:41:58,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:41:58,249 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 17:41:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:58,250 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:41:58,250 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:41:58,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:41:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:41:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 17:41:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:41:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-03 17:41:58,260 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 83 [2018-12-03 17:41:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:58,260 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-03 17:41:58,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:41:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-03 17:41:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:41:58,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:58,261 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 17:41:58,262 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:58,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -84933055, now seen corresponding path program 30 times [2018-12-03 17:41:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:58,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:58,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:41:58,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:58,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:58,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:58,799 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:41:58,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:58,799 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:41:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:58,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:58,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:58,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:58,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:41:58,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:41:59,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 17:41:59,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:59,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:41:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:41:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:59,654 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 33 states. [2018-12-03 17:41:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:59,864 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2018-12-03 17:41:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:41:59,864 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 17:41:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:59,865 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:41:59,865 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:41:59,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:41:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:41:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:41:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 17:41:59,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 87 [2018-12-03 17:41:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:59,879 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 17:41:59,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:41:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 17:41:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:41:59,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:59,880 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 17:41:59,880 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:59,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:59,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1939448792, now seen corresponding path program 31 times [2018-12-03 17:41:59,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:59,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:59,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:42:00,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:00,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:00,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:00,358 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:42:00,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:00,358 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:42:00,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:00,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:00,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:42:00,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:42:01,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:01,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 17:42:01,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:01,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:42:01,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:42:01,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:01,262 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 34 states. [2018-12-03 17:42:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:01,438 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-12-03 17:42:01,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:42:01,438 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 17:42:01,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:01,439 INFO L225 Difference]: With dead ends: 119 [2018-12-03 17:42:01,439 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:42:01,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:42:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:42:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:42:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 17:42:01,451 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 89 [2018-12-03 17:42:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:01,452 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 17:42:01,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:42:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 17:42:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:42:01,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:01,453 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 17:42:01,453 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:01,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1717644209, now seen corresponding path program 32 times [2018-12-03 17:42:01,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:01,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:01,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 17:42:02,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:02,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:02,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:02,246 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:42:02,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:02,246 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:42:02,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:02,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:02,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:42:02,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:02,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 17:42:03,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 17:42:03,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:03,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 17:42:03,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:03,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:42:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:42:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:42:03,900 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 48 states. [2018-12-03 17:42:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:04,131 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-12-03 17:42:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:42:04,132 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 17:42:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:04,133 INFO L225 Difference]: With dead ends: 124 [2018-12-03 17:42:04,133 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:42:04,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:42:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:42:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 17:42:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:42:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-12-03 17:42:04,143 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 91 [2018-12-03 17:42:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:04,144 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-12-03 17:42:04,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:42:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-12-03 17:42:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:42:04,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:04,144 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 17:42:04,145 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:04,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash -73528097, now seen corresponding path program 33 times [2018-12-03 17:42:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:04,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:04,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:04,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:04,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:04,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:04,695 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:42:04,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:04,695 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:42:04,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:04,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:04,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:04,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:04,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:04,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:05,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 17:42:05,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:05,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:42:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:42:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:05,563 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 36 states. [2018-12-03 17:42:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:05,670 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-12-03 17:42:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:42:05,671 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 17:42:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:05,672 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:42:05,672 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:42:05,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:42:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:42:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:42:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 17:42:05,684 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 95 [2018-12-03 17:42:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:05,684 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 17:42:05,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:42:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 17:42:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:42:05,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:05,685 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 17:42:05,685 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:05,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash 967805894, now seen corresponding path program 34 times [2018-12-03 17:42:05,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:05,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:05,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:06,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:06,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:06,499 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:42:06,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:06,499 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:42:06,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:06,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:06,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:06,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:07,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:07,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 17:42:07,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:42:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:42:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:07,820 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 37 states. [2018-12-03 17:42:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:07,979 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2018-12-03 17:42:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:42:07,979 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 17:42:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:07,981 INFO L225 Difference]: With dead ends: 129 [2018-12-03 17:42:07,981 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:42:07,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:42:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:42:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:42:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 17:42:07,996 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 97 [2018-12-03 17:42:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:07,996 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 17:42:07,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:42:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 17:42:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:42:07,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:07,997 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 17:42:07,997 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:07,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash 962391277, now seen corresponding path program 35 times [2018-12-03 17:42:07,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:07,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:07,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:07,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:07,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 17:42:08,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:08,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:08,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:08,760 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:42:08,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:08,760 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:42:08,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:08,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:08,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:42:08,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:08,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 17:42:09,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 17:42:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 17:42:09,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:09,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:42:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:42:09,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:42:09,893 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 52 states. [2018-12-03 17:42:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:10,164 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-12-03 17:42:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:42:10,164 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 17:42:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:10,165 INFO L225 Difference]: With dead ends: 134 [2018-12-03 17:42:10,165 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:42:10,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:42:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:42:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 17:42:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:42:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-12-03 17:42:10,175 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 99 [2018-12-03 17:42:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:10,176 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-12-03 17:42:10,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:42:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-12-03 17:42:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:42:10,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:10,177 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 17:42:10,177 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:10,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash 269541117, now seen corresponding path program 36 times [2018-12-03 17:42:10,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:10,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:10,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:10,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:10,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:10,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:10,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:42:10,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:10,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 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:42:10,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:10,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:10,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:10,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:10,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:10,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:11,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:11,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 17:42:11,744 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:11,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:42:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:42:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:11,745 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 39 states. [2018-12-03 17:42:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:11,986 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2018-12-03 17:42:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:42:11,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 17:42:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:11,987 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:42:11,988 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:42:11,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:42:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:42:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:42:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 17:42:11,998 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 103 [2018-12-03 17:42:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:11,998 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 17:42:11,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:42:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 17:42:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:42:11,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:11,999 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 17:42:11,999 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:11,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash 629442276, now seen corresponding path program 37 times [2018-12-03 17:42:11,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:12,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:12,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:12,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:12,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:12,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:12,989 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:42:12,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:12,989 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:42:13,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:13,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:13,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:13,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:14,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:14,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 17:42:14,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:14,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:42:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:42:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:14,004 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 40 states. [2018-12-03 17:42:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:14,185 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2018-12-03 17:42:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:42:14,186 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 17:42:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:14,187 INFO L225 Difference]: With dead ends: 139 [2018-12-03 17:42:14,187 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:42:14,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:42:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:42:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:42:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 17:42:14,201 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 105 [2018-12-03 17:42:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:14,201 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 17:42:14,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:42:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 17:42:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:42:14,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:14,202 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 17:42:14,202 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:14,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:14,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1397894901, now seen corresponding path program 38 times [2018-12-03 17:42:14,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:14,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:14,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 17:42:14,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:14,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:14,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:14,847 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:42:14,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:14,847 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:42:14,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:14,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:14,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 17:42:14,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:14,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 17:42:15,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 17:42:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 17:42:16,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:16,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:42:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:42:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:42:16,067 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 56 states. [2018-12-03 17:42:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:16,405 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2018-12-03 17:42:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:42:16,405 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 17:42:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:16,406 INFO L225 Difference]: With dead ends: 144 [2018-12-03 17:42:16,406 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:42:16,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:42:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:42:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 17:42:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:42:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-03 17:42:16,420 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 107 [2018-12-03 17:42:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:16,421 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-03 17:42:16,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:42:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-03 17:42:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:42:16,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:16,422 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 17:42:16,422 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:16,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 404266139, now seen corresponding path program 39 times [2018-12-03 17:42:16,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:16,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:16,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:17,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:17,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:17,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:17,502 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:42:17,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:17,502 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:42:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:17,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:17,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:17,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:17,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:17,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:18,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:18,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 17:42:18,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:18,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:42:18,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:42:18,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:18,757 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 42 states. [2018-12-03 17:42:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:19,129 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2018-12-03 17:42:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:42:19,130 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 17:42:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:19,131 INFO L225 Difference]: With dead ends: 147 [2018-12-03 17:42:19,131 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:42:19,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:42:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:42:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:42:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 17:42:19,143 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 111 [2018-12-03 17:42:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:19,143 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 17:42:19,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:42:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 17:42:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:42:19,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:19,144 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 17:42:19,144 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:19,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2025155970, now seen corresponding path program 40 times [2018-12-03 17:42:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:19,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:19,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:20,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:20,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:20,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:20,583 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:42:20,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:20,584 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:42:20,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:20,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:20,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:20,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:21,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:21,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 17:42:21,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:21,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:42:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:42:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:21,575 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 43 states. [2018-12-03 17:42:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:22,303 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2018-12-03 17:42:22,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:42:22,303 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 17:42:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:22,304 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:42:22,304 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:42:22,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:42:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 17:42:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:42:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 17:42:22,316 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 113 [2018-12-03 17:42:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:22,316 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 17:42:22,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:42:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 17:42:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:42:22,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:22,317 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 17:42:22,317 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:22,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 627155113, now seen corresponding path program 41 times [2018-12-03 17:42:22,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:22,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:22,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 17:42:23,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:23,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:23,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:23,023 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:42:23,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:23,023 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:42:23,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:23,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:23,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:42:23,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:23,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 17:42:23,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 17:42:24,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:24,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 17:42:24,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:24,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:42:24,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:42:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:42:24,386 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 60 states. [2018-12-03 17:42:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:24,714 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-12-03 17:42:24,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:42:24,714 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 17:42:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:24,716 INFO L225 Difference]: With dead ends: 154 [2018-12-03 17:42:24,716 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 17:42:24,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:42:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 17:42:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 17:42:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 17:42:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-12-03 17:42:24,727 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 115 [2018-12-03 17:42:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:24,728 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-12-03 17:42:24,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:42:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-12-03 17:42:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 17:42:24,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:24,729 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 17:42:24,729 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:24,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1694669383, now seen corresponding path program 42 times [2018-12-03 17:42:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:24,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:24,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:25,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:25,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:25,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:42:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:25,545 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:42:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:25,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:25,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:25,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:25,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:25,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:26,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:26,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 17:42:26,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:26,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:42:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:42:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:26,622 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 45 states. [2018-12-03 17:42:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:26,820 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-12-03 17:42:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:42:26,820 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 17:42:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:26,821 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:42:26,822 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 17:42:26,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 17:42:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 17:42:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 17:42:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 17:42:26,835 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 119 [2018-12-03 17:42:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:26,836 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 17:42:26,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:42:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 17:42:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 17:42:26,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:26,837 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 17:42:26,837 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:26,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash 59400096, now seen corresponding path program 43 times [2018-12-03 17:42:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:26,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:26,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:28,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:28,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:28,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:28,039 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:42:28,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:28,039 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:42:28,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:28,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:28,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:28,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:29,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:29,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 17:42:29,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:29,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:42:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:42:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:29,563 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 46 states. [2018-12-03 17:42:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:29,837 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2018-12-03 17:42:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:42:29,837 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 17:42:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:29,839 INFO L225 Difference]: With dead ends: 159 [2018-12-03 17:42:29,839 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 17:42:29,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 17:42:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 17:42:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:42:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 17:42:29,856 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 121 [2018-12-03 17:42:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:29,856 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 17:42:29,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:42:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 17:42:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:42:29,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:29,857 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 17:42:29,858 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:29,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2092989383, now seen corresponding path program 44 times [2018-12-03 17:42:29,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:29,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:29,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 17:42:30,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:30,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:30,820 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:30,820 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:42:30,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:30,820 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:42:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:30,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:30,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:42:30,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:30,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 17:42:31,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 17:42:32,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:32,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 17:42:32,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:32,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:42:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:42:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:42:32,824 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 64 states. [2018-12-03 17:42:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:33,299 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-03 17:42:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:42:33,300 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 17:42:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:33,301 INFO L225 Difference]: With dead ends: 164 [2018-12-03 17:42:33,301 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 17:42:33,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:42:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 17:42:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 17:42:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 17:42:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-12-03 17:42:33,314 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 123 [2018-12-03 17:42:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:33,314 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-12-03 17:42:33,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:42:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-12-03 17:42:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 17:42:33,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:33,315 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 17:42:33,316 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:33,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -914400681, now seen corresponding path program 45 times [2018-12-03 17:42:33,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:33,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:33,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:34,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:34,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:34,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:34,169 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:42:34,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:34,169 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:42:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:34,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:34,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:34,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:34,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:34,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:35,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:35,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 17:42:35,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:35,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:42:35,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:42:35,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:35,159 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 48 states. [2018-12-03 17:42:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:35,335 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-12-03 17:42:35,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:42:35,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 17:42:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:35,337 INFO L225 Difference]: With dead ends: 167 [2018-12-03 17:42:35,337 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 17:42:35,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 17:42:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 17:42:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 17:42:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 17:42:35,349 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 127 [2018-12-03 17:42:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:35,350 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 17:42:35,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:42:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 17:42:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 17:42:35,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:35,350 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 17:42:35,351 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:35,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1069776190, now seen corresponding path program 46 times [2018-12-03 17:42:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:35,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:35,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:36,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:36,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:36,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:36,346 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:42:36,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:36,346 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:42:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:36,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:36,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:36,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:37,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:37,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 17:42:37,417 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:37,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:42:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:42:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:37,418 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 49 states. [2018-12-03 17:42:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:37,635 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-12-03 17:42:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:42:37,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 17:42:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:37,637 INFO L225 Difference]: With dead ends: 169 [2018-12-03 17:42:37,637 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 17:42:37,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 17:42:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 17:42:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 17:42:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 17:42:37,652 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 129 [2018-12-03 17:42:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:37,652 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 17:42:37,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:42:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 17:42:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 17:42:37,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:37,654 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 17:42:37,654 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:37,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 898269797, now seen corresponding path program 47 times [2018-12-03 17:42:37,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:37,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:37,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:37,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:37,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 17:42:38,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:38,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:38,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:38,700 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:42:38,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:38,700 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:42:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:38,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:38,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 17:42:38,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:38,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 17:42:39,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 17:42:40,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:40,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 17:42:40,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:42:40,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:42:40,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:42:40,539 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 68 states. [2018-12-03 17:42:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:41,178 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-12-03 17:42:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:42:41,178 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 17:42:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:41,180 INFO L225 Difference]: With dead ends: 174 [2018-12-03 17:42:41,180 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 17:42:41,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:42:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 17:42:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 17:42:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:42:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-12-03 17:42:41,197 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 131 [2018-12-03 17:42:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:41,198 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-12-03 17:42:41,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:42:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-12-03 17:42:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 17:42:41,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:41,199 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 17:42:41,199 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:41,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2712971, now seen corresponding path program 48 times [2018-12-03 17:42:41,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:41,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:41,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 17:42:43,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:43,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:43,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:43,479 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:42:43,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:43,479 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:42:43,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:43,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:43,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:43,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:43,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 17:42:43,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 17:42:44,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:44,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 17:42:44,672 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:44,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:42:44,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:42:44,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:44,673 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 51 states. [2018-12-03 17:42:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:44,882 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2018-12-03 17:42:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:42:44,883 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 17:42:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:44,884 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:42:44,884 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 17:42:44,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 17:42:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 17:42:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 17:42:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 17:42:44,897 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 135 [2018-12-03 17:42:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:44,897 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 17:42:44,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:42:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 17:42:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 17:42:44,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:44,898 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 17:42:44,898 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:44,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash -761731492, now seen corresponding path program 49 times [2018-12-03 17:42:44,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:44,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:44,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 17:42:46,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:46,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:46,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:46,096 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:42:46,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:46,097 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:42:46,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:46,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:46,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 17:42:46,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 17:42:48,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:48,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 17:42:48,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:48,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:42:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:42:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:48,652 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 52 states. [2018-12-03 17:42:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:48,870 INFO L93 Difference]: Finished difference Result 179 states and 216 transitions. [2018-12-03 17:42:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:42:48,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 17:42:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:48,872 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:42:48,872 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 17:42:48,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:42:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 17:42:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 17:42:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 17:42:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 17:42:48,888 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 137 [2018-12-03 17:42:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:48,888 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 17:42:48,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:42:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 17:42:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 17:42:48,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:48,889 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 17:42:48,889 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:48,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash -34089853, now seen corresponding path program 50 times [2018-12-03 17:42:48,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:48,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:42:50,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:50,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:50,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:50,177 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:42:50,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:50,177 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:42:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:50,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:50,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:42:50,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:50,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:42:50,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:42:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 17:42:50,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:50,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:42:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:42:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:42:50,750 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 23 states. [2018-12-03 17:42:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:50,855 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-03 17:42:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:42:50,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 17:42:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:50,857 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:42:50,857 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 17:42:50,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:42:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 17:42:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-12-03 17:42:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 17:42:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-12-03 17:42:50,875 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 139 [2018-12-03 17:42:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:50,875 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-12-03 17:42:50,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:42:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-12-03 17:42:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 17:42:50,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:50,877 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 17:42:50,877 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:50,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1920855678, now seen corresponding path program 51 times [2018-12-03 17:42:50,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:50,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:50,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:42:52,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:52,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:52,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:52,661 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:42:52,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:52,661 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:42:52,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:52,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:52,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:52,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:52,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:54,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:56,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:56,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 17:42:56,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:56,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:42:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:42:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:42:56,421 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 76 states. [2018-12-03 17:42:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:56,840 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2018-12-03 17:42:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:42:56,840 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 17:42:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:56,841 INFO L225 Difference]: With dead ends: 155 [2018-12-03 17:42:56,841 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 17:42:56,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:42:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 17:42:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-12-03 17:42:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 17:42:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2018-12-03 17:42:56,853 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 145 [2018-12-03 17:42:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:56,853 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2018-12-03 17:42:56,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:42:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2018-12-03 17:42:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 17:42:56,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:56,855 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 17:42:56,855 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:56,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1141465145, now seen corresponding path program 52 times [2018-12-03 17:42:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:56,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:56,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:42:58,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:58,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:58,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:58,356 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:42:58,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:58,356 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:42:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:58,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:58,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:59,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:01,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:01,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 17:43:01,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:01,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:43:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:43:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:01,440 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 79 states. [2018-12-03 17:43:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:01,992 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2018-12-03 17:43:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:43:01,993 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 17:43:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:01,994 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:43:01,994 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 17:43:01,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 17:43:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-12-03 17:43:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 17:43:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-12-03 17:43:02,004 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 151 [2018-12-03 17:43:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:02,005 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-12-03 17:43:02,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:43:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-12-03 17:43:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 17:43:02,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:02,006 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 17:43:02,006 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:02,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash -978757196, now seen corresponding path program 53 times [2018-12-03 17:43:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:02,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:02,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:02,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:02,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:02,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:02,487 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:43:02,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:02,487 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:43:02,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:02,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:02,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 17:43:02,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:02,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:02,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:03,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:03,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 17:43:03,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:03,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:43:03,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:43:03,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:03,590 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand 32 states. [2018-12-03 17:43:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:03,741 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2018-12-03 17:43:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:43:03,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 17:43:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:03,743 INFO L225 Difference]: With dead ends: 167 [2018-12-03 17:43:03,743 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 17:43:03,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 17:43:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-12-03 17:43:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 17:43:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-12-03 17:43:03,754 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 157 [2018-12-03 17:43:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:03,754 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-12-03 17:43:03,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:43:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-12-03 17:43:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 17:43:03,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:03,756 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 17:43:03,756 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:03,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1370944785, now seen corresponding path program 54 times [2018-12-03 17:43:03,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:03,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:03,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:04,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:04,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:04,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:04,365 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:43:04,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:04,365 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:43:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:04,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:04,425 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:04,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:04,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:05,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:07,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:07,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 17:43:07,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:07,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:43:07,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:43:07,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:07,322 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 85 states. [2018-12-03 17:43:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:07,897 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-12-03 17:43:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:43:07,897 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 17:43:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:07,899 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:43:07,899 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 17:43:07,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 17:43:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-12-03 17:43:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 17:43:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2018-12-03 17:43:07,914 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 163 [2018-12-03 17:43:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:07,915 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2018-12-03 17:43:07,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:43:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2018-12-03 17:43:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 17:43:07,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:07,916 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 17:43:07,916 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:07,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:07,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1011899414, now seen corresponding path program 55 times [2018-12-03 17:43:07,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:07,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:07,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:07,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:08,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:08,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:08,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:08,768 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:43:08,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:08,768 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:43:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:08,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:08,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:10,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:11,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:11,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 17:43:11,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:11,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:43:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:43:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:11,854 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand 88 states. [2018-12-03 17:43:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:12,579 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2018-12-03 17:43:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:43:12,579 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 17:43:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:12,581 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:43:12,581 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 17:43:12,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 17:43:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-12-03 17:43:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 17:43:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2018-12-03 17:43:12,594 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 169 [2018-12-03 17:43:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:12,594 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2018-12-03 17:43:12,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:43:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2018-12-03 17:43:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 17:43:12,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:12,595 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 17:43:12,596 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:12,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1166038181, now seen corresponding path program 56 times [2018-12-03 17:43:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:12,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:13,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:13,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:13,605 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:13,605 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:43:13,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:13,605 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:43:13,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:13,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:13,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 17:43:13,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:13,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:13,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:14,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:14,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 17:43:14,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:14,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:43:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:43:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:14,831 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand 41 states. [2018-12-03 17:43:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:15,087 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-12-03 17:43:15,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:43:15,088 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 17:43:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:15,089 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:43:15,089 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 17:43:15,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 17:43:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-12-03 17:43:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 17:43:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2018-12-03 17:43:15,105 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 175 [2018-12-03 17:43:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:15,105 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2018-12-03 17:43:15,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:43:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2018-12-03 17:43:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 17:43:15,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:15,106 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 17:43:15,107 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:15,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash 406474016, now seen corresponding path program 57 times [2018-12-03 17:43:15,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:15,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:15,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:15,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:15,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:16,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:16,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:16,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:16,029 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:43:16,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:16,029 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:43:16,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:16,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:16,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:16,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:16,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:17,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:19,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:19,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 17:43:19,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:19,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:43:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:43:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:19,201 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand 94 states. [2018-12-03 17:43:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:19,934 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2018-12-03 17:43:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:43:19,934 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 17:43:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:19,935 INFO L225 Difference]: With dead ends: 191 [2018-12-03 17:43:19,935 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 17:43:19,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 17:43:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-12-03 17:43:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 17:43:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2018-12-03 17:43:19,945 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 181 [2018-12-03 17:43:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:19,945 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2018-12-03 17:43:19,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:43:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2018-12-03 17:43:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 17:43:19,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:19,946 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 17:43:19,946 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:19,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1338458789, now seen corresponding path program 58 times [2018-12-03 17:43:19,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:19,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:19,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:20,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:20,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:20,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:20,794 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:43:20,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:20,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 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:43:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:20,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:20,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:22,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:24,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 17:43:24,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:24,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:43:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:43:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:24,316 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 97 states. [2018-12-03 17:43:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:25,144 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-12-03 17:43:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:43:25,145 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 17:43:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:25,146 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:43:25,146 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 17:43:25,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 17:43:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-12-03 17:43:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 17:43:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-12-03 17:43:25,158 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 187 [2018-12-03 17:43:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:25,159 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-12-03 17:43:25,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:43:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-12-03 17:43:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 17:43:25,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:25,160 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 17:43:25,160 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:25,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1129130666, now seen corresponding path program 59 times [2018-12-03 17:43:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:25,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 17:43:26,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:26,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:26,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:26,088 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:43:26,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:26,088 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:43:26,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:26,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:26,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 17:43:26,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:26,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:26,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:27,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 17:43:27,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:27,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:43:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:43:27,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:27,212 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 50 states. [2018-12-03 17:43:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:27,546 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-12-03 17:43:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:43:27,546 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 17:43:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:27,547 INFO L225 Difference]: With dead ends: 203 [2018-12-03 17:43:27,547 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 17:43:27,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 17:43:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-12-03 17:43:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 17:43:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-12-03 17:43:27,561 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 193 [2018-12-03 17:43:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:27,562 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-12-03 17:43:27,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:43:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-12-03 17:43:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 17:43:27,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:27,563 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 17:43:27,563 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:27,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:27,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1833188079, now seen corresponding path program 60 times [2018-12-03 17:43:27,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:27,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:27,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:28,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:28,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:28,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:28,534 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:43:28,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:28,534 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:43:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:28,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:28,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:28,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:28,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:29,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 17:43:31,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:31,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:43:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:43:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:31,899 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 101 states. [2018-12-03 17:43:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:32,884 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-12-03 17:43:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:43:32,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 17:43:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:32,886 INFO L225 Difference]: With dead ends: 205 [2018-12-03 17:43:32,886 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 17:43:32,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 17:43:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 17:43:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 17:43:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2018-12-03 17:43:32,901 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 199 [2018-12-03 17:43:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:32,902 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2018-12-03 17:43:32,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:43:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2018-12-03 17:43:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 17:43:32,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:32,903 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 17:43:32,903 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:32,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash -757086086, now seen corresponding path program 61 times [2018-12-03 17:43:32,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:32,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:32,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 17:43:34,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:34,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:34,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:34,136 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:43:34,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:34,136 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:43:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:34,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:34,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:35,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:37,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:37,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 17:43:37,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:37,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:43:37,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:43:37,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:37,429 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 102 states. [2018-12-03 17:43:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:38,376 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2018-12-03 17:43:38,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:43:38,376 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 17:43:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:38,377 INFO L225 Difference]: With dead ends: 206 [2018-12-03 17:43:38,377 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 17:43:38,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:43:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 17:43:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 17:43:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 17:43:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2018-12-03 17:43:38,389 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 201 [2018-12-03 17:43:38,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:38,390 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2018-12-03 17:43:38,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:43:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2018-12-03 17:43:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 17:43:38,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:38,391 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 17:43:38,391 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:38,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1710189149, now seen corresponding path program 62 times [2018-12-03 17:43:38,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:38,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 17:43:40,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:40,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:40,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:40,318 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:43:40,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:40,318 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:43:40,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:40,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:40,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 17:43:40,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:40,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 17:43:41,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 17:43:41,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:41,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 17:43:41,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:41,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:43:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:43:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:43:41,899 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2018-12-03 17:43:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:43,974 INFO L93 Difference]: Finished difference Result 2857 states and 4232 transitions. [2018-12-03 17:43:43,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:43:43,974 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 17:43:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:43,984 INFO L225 Difference]: With dead ends: 2857 [2018-12-03 17:43:43,984 INFO L226 Difference]: Without dead ends: 2855 [2018-12-03 17:43:43,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:43:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-03 17:43:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 206. [2018-12-03 17:43:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 17:43:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2018-12-03 17:43:44,098 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 203 [2018-12-03 17:43:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:44,099 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2018-12-03 17:43:44,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:43:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2018-12-03 17:43:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 17:43:44,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:44,100 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1] [2018-12-03 17:43:44,100 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:44,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1480768652, now seen corresponding path program 63 times [2018-12-03 17:43:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:44,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:44,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:44,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 17:43:45,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:43:45,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 17:43:45,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:43:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:43:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:43:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:43:45,800 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand 52 states. [2018-12-03 17:43:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:46,153 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-12-03 17:43:46,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:43:46,153 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 205 [2018-12-03 17:43:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:46,154 INFO L225 Difference]: With dead ends: 305 [2018-12-03 17:43:46,154 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:43:46,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 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:43:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:43:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:43:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:43:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:43:46,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2018-12-03 17:43:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:46,156 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:43:46,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:43:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:43:46,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:43:46,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:43:46,986 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 1848 DAG size of output: 407 [2018-12-03 17:43:47,607 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 1843 DAG size of output: 400 [2018-12-03 17:43:52,546 WARN L180 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-12-03 17:43:54,142 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-12-03 17:43:54,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-12-03 17:43:54,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-12-03 17:43:54,150 INFO L444 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 17:43:54,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-12-03 17:43:54,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-12-03 17:43:54,150 INFO L444 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-12-03 17:43:54,152 INFO L444 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 17:43:54,171 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:43:54 BoogieIcfgContainer [2018-12-03 17:43:54,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:43:54,172 INFO L168 Benchmark]: Toolchain (without parser) took 150040.76 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -756.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:43:54,173 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:43:54,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:43:54,174 INFO L168 Benchmark]: Boogie Preprocessor took 24.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:43:54,174 INFO L168 Benchmark]: RCFGBuilder took 247.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 17:43:54,175 INFO L168 Benchmark]: TraceAbstraction took 149724.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-12-03 17:43:54,177 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 247.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149724.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 50 && main_~x~4 <= 50) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 50 && main_~x~4 <= 50) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 149.6s OverallTime, 65 OverallIterations, 101 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 7.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 332 SDtfs, 1472 SDslu, 6255 SDs, 0 SdLazy, 9709 SolverSat, 2409 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 13449 GetRequests, 9198 SyntacticMatches, 1132 SemanticMatches, 3119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125668 ImplicationChecksByTransitivity, 110.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9 AbsIntWeakeningRatio, 0.5 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 2678 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 204 NumberOfFragments, 1406 HoareAnnotationTreeSize, 3 FomulaSimplifications, 36740 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 396 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 114.6s InterpolantComputationTime, 11885 NumberOfCodeBlocks, 11293 NumberOfCodeBlocksAsserted, 820 NumberOfCheckSat, 17532 ConstructedInterpolants, 0 QuantifiedInterpolants, 5655520 SizeOfPredicates, 51 NumberOfNonLiveVariables, 12884 ConjunctsInSsa, 2047 ConjunctsInUnsatCore, 189 InterpolantComputations, 2 PerfectInterpolantSequences, 262904/532271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...