java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:36:58,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:36:58,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:36:58,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:36:58,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:36:58,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:36:58,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:36:58,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:36:58,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:36:58,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:36:58,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:36:58,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:36:58,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:36:58,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:36:58,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:36:58,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:36:58,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:36:58,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:36:58,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:36:58,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:36:58,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:36:58,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:36:58,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:36:58,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:36:58,866 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:36:58,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:36:58,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:36:58,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:36:58,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:36:58,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:36:58,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:36:58,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:36:58,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:36:58,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:36:58,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:36:58,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:36:58,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:36:58,885 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:36:58,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:36:58,887 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:36:58,887 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:36:58,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:36:58,887 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:36:58,887 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:36:58,888 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:36:58,888 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:36:58,888 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:36:58,888 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:36:58,888 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:36:58,889 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:36:58,889 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:36:58,889 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:36:58,890 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:36:58,890 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:36:58,890 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:36:58,891 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:36:58,891 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:36:58,891 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:36:58,891 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:36:58,891 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:36:58,892 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:36:58,892 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:36:58,892 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:36:58,892 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:36:58,892 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:36:58,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:36:58,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:36:58,893 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:36:58,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:36:58,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:36:58,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:36:58,894 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:36:58,894 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:36:58,894 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:36:58,894 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:36:58,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:36:58,895 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:36:58,895 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:36:58,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:36:58,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:36:58,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:36:58,950 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:36:58,951 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:36:58,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl [2018-12-03 16:36:58,952 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl' [2018-12-03 16:36:59,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:36:59,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:36:59,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:36:59,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:36:59,005 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:36:59,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:36:59,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:36:59,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:36:59,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:36:59,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... [2018-12-03 16:36:59,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:36:59,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:36:59,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:36:59,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:36:59,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:36:59,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:36:59,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:36:59,377 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:36:59,377 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 16:36:59,378 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:36:59 BoogieIcfgContainer [2018-12-03 16:36:59,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:36:59,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:36:59,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:36:59,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:36:59,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:36:58" (1/2) ... [2018-12-03 16:36:59,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e734f9 and model type down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:36:59, skipping insertion in model container [2018-12-03 16:36:59,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:36:59" (2/2) ... [2018-12-03 16:36:59,386 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bpl [2018-12-03 16:36:59,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:36:59,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:36:59,425 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:36:59,461 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:36:59,462 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:36:59,462 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:36:59,462 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:36:59,462 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:36:59,462 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:36:59,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:36:59,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:36:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 16:36:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:36:59,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:59,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:36:59,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:59,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 28787237, now seen corresponding path program 1 times [2018-12-03 16:36:59,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:59,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:59,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:36:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:36:59,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:36:59,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:36:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:36:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:36:59,776 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 16:36:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:59,916 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-03 16:36:59,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:36:59,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 16:36:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:59,929 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:36:59,929 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:36:59,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:36:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:36:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:36:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:36:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:36:59,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 16:36:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:59,971 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:36:59,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:36:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:36:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:36:59,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:59,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:36:59,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:59,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash 894126414, now seen corresponding path program 1 times [2018-12-03 16:36:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:59,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:59,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:37:00,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:37:00,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:37:00,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:37:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:37:00,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:37:00,055 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-03 16:37:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:00,162 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 16:37:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:37:00,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 16:37:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:00,163 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:37:00,163 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:37:00,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:37:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:37:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 16:37:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:37:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 16:37:00,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 16:37:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:00,169 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 16:37:00,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:37:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 16:37:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:37:00,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:00,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:37:00,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:00,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash 261957866, now seen corresponding path program 1 times [2018-12-03 16:37:00,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:00,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:00,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:00,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:00,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:00,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:00,245 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:37:00,247 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17] [2018-12-03 16:37:00,293 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:37:00,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:37:00,660 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:37:00,661 INFO L272 AbstractInterpreter]: Visited 7 different actions 29 times. Merged at 6 different actions 19 times. Widened at 2 different actions 2 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:37:00,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:00,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:37:00,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:00,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:00,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:00,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:00,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:00,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:00,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:37:00,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:00,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:37:00,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:37:00,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:37:00,965 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-12-03 16:37:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:01,221 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 16:37:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:37:01,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-03 16:37:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:01,222 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:37:01,222 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:37:01,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:37:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:37:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:37:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:37:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 16:37:01,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 16:37:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:01,228 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 16:37:01,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:37:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 16:37:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:37:01,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:01,229 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:37:01,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:01,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1187669281, now seen corresponding path program 2 times [2018-12-03 16:37:01,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:01,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:01,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:01,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:01,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:01,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:01,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:01,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:01,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:01,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:01,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:01,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:01,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:37:01,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:01,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:01,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:01,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:01,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-03 16:37:01,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:01,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:37:01,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:37:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:37:01,663 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 16:37:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:01,840 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-12-03 16:37:01,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:37:01,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:37:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:01,842 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:37:01,842 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:37:01,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:37:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:37:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 16:37:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:37:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 16:37:01,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-12-03 16:37:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:01,847 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 16:37:01,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:37:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 16:37:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:37:01,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:01,849 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-03 16:37:01,849 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:01,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1111188483, now seen corresponding path program 3 times [2018-12-03 16:37:01,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:01,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:01,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:01,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:01,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:01,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:01,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:01,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:01,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:01,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:01,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:01,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:01,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:01,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:01,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:02,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:02,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:02,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:02,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:37:02,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:02,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:37:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:37:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:37:02,308 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2018-12-03 16:37:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:02,493 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-03 16:37:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:37:02,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 16:37:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:02,494 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:37:02,495 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:37:02,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:37:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:37:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:37:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:37:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 16:37:02,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-03 16:37:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:02,500 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 16:37:02,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:37:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 16:37:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:37:02,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:02,501 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-12-03 16:37:02,501 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:02,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1227431834, now seen corresponding path program 4 times [2018-12-03 16:37:02,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:02,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:02,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:02,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:02,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:02,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:02,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:02,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:02,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:02,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:02,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:02,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:02,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:02,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:02,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2018-12-03 16:37:02,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:02,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:37:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:37:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:37:02,800 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-12-03 16:37:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:02,949 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 16:37:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:37:02,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:37:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:02,951 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:37:02,952 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:37:02,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:37:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:37:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 16:37:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:37:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 16:37:02,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 16:37:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:02,958 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 16:37:02,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:37:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 16:37:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:37:02,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:02,959 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2018-12-03 16:37:02,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:02,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1553947138, now seen corresponding path program 5 times [2018-12-03 16:37:02,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:02,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:02,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:02,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:03,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:03,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:03,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:03,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:03,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:03,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:03,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:03,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:03,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:37:03,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:03,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:03,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 16:37:03,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:03,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:37:03,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:37:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:37:03,493 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-12-03 16:37:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:03,644 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 16:37:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:37:03,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-12-03 16:37:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:03,645 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:37:03,645 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:37:03,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:37:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:37:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:37:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:37:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 16:37:03,649 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 16:37:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:03,650 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 16:37:03,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:37:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 16:37:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:37:03,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:03,651 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2018-12-03 16:37:03,651 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:03,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash 291918073, now seen corresponding path program 6 times [2018-12-03 16:37:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:03,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:03,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:03,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:03,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:03,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:03,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:03,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:03,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:03,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:03,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:03,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:03,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:03,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:03,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:04,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:04,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2018-12-03 16:37:04,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:37:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:37:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:37:04,029 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-12-03 16:37:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:04,177 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-03 16:37:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:37:04,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 16:37:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:04,178 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:37:04,178 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:37:04,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:37:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:37:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 16:37:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:37:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 16:37:04,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-12-03 16:37:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:04,184 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 16:37:04,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:37:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 16:37:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:37:04,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:04,185 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2018-12-03 16:37:04,185 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:04,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1360327125, now seen corresponding path program 7 times [2018-12-03 16:37:04,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:04,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:04,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:04,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:04,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:04,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:04,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:04,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:04,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:04,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:04,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:04,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:04,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:04,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:04,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 16:37:04,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:04,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:37:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:37:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:37:04,509 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-12-03 16:37:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:04,660 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 16:37:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:37:04,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-12-03 16:37:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:04,661 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:37:04,661 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:37:04,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:37:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:37:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:37:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:37:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 16:37:04,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-12-03 16:37:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:04,667 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 16:37:04,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:37:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 16:37:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:37:04,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:04,668 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2018-12-03 16:37:04,668 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:04,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1898806402, now seen corresponding path program 8 times [2018-12-03 16:37:04,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:04,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:04,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:04,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:04,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:04,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:04,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:04,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:04,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:04,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:04,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:37:04,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:04,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:04,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2018-12-03 16:37:05,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:05,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:37:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:37:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:37:05,035 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2018-12-03 16:37:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:05,162 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 16:37:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:37:05,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 16:37:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:05,164 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:37:05,164 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:37:05,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:37:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:37:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-03 16:37:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:37:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 16:37:05,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 16:37:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:05,170 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 16:37:05,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:37:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 16:37:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:37:05,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:05,172 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2018-12-03 16:37:05,172 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:05,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 608081690, now seen corresponding path program 9 times [2018-12-03 16:37:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:05,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:05,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:05,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:05,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:05,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:05,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:05,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:05,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:05,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:05,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:05,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:05,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:05,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:05,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:05,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:05,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 16:37:05,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:05,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:37:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:37:05,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:37:05,711 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2018-12-03 16:37:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:06,214 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-03 16:37:06,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:37:06,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:37:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:06,216 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:37:06,216 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:37:06,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:37:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:37:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:37:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:37:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 16:37:06,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 16:37:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:06,222 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 16:37:06,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:37:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 16:37:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:37:06,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:06,223 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2018-12-03 16:37:06,223 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:06,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash -208127791, now seen corresponding path program 10 times [2018-12-03 16:37:06,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:06,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:06,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:06,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:06,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:06,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:06,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:06,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:06,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:06,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:06,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:06,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:06,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:06,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:06,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 11 [2018-12-03 16:37:06,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:06,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:37:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:37:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:37:06,850 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-12-03 16:37:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:07,150 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-03 16:37:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:37:07,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-03 16:37:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:07,151 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:37:07,152 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:37:07,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:37:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:37:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 16:37:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:37:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 16:37:07,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-03 16:37:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:07,159 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 16:37:07,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:37:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 16:37:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:37:07,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:07,160 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2018-12-03 16:37:07,161 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:07,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1852588973, now seen corresponding path program 11 times [2018-12-03 16:37:07,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:07,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:07,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:07,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:07,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:07,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:07,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:07,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:07,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:07,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:07,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:37:07,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:07,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:07,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:07,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:07,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 16:37:07,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:07,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:37:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:37:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:37:07,917 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2018-12-03 16:37:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:08,170 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 16:37:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:37:08,171 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-12-03 16:37:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:08,171 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:37:08,171 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:37:08,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:37:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:37:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:37:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:37:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 16:37:08,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-03 16:37:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:08,179 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 16:37:08,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:37:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 16:37:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:37:08,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:08,180 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2018-12-03 16:37:08,180 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:08,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash -34196842, now seen corresponding path program 12 times [2018-12-03 16:37:08,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:08,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:08,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:08,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:08,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:08,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:08,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:08,349 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:08,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:08,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:08,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:08,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:08,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:08,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:08,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:08,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:08,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2018-12-03 16:37:08,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:08,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:37:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:37:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:37:08,555 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 16:37:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:08,702 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 16:37:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:37:08,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 16:37:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:08,704 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:37:08,704 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:37:08,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:37:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:37:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-03 16:37:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:37:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 16:37:08,710 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 16:37:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:08,711 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 16:37:08,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:37:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 16:37:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:37:08,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:08,712 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2018-12-03 16:37:08,712 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:08,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1496506418, now seen corresponding path program 13 times [2018-12-03 16:37:08,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:08,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:08,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:08,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:08,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:08,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:08,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:08,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:08,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:08,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:08,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:08,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:08,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:09,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:09,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:37:09,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:09,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:37:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:37:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:37:09,340 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2018-12-03 16:37:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:09,586 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 16:37:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:37:09,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-12-03 16:37:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:09,587 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:37:09,587 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:37:09,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:37:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:37:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:37:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:37:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 16:37:09,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 16:37:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:09,594 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 16:37:09,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:37:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 16:37:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:37:09,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:09,595 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2018-12-03 16:37:09,595 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:09,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 497294505, now seen corresponding path program 14 times [2018-12-03 16:37:09,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:09,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:09,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:09,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:09,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:09,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:09,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:09,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:09,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:09,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:09,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:09,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:09,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:37:09,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:09,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:09,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:09,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 13 [2018-12-03 16:37:09,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:09,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:37:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:37:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:37:09,965 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 16:37:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:10,142 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-03 16:37:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:37:10,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 16:37:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:10,144 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:37:10,144 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:37:10,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:37:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:37:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-03 16:37:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:37:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 16:37:10,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-12-03 16:37:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:10,152 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 16:37:10,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:37:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 16:37:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:37:10,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:10,153 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2018-12-03 16:37:10,153 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:10,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1158582661, now seen corresponding path program 15 times [2018-12-03 16:37:10,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:10,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:10,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:10,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:10,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:10,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:10,703 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:10,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:10,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:10,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:10,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:10,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:10,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:10,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:10,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:10,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 16:37:10,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:10,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:37:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:37:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:37:10,939 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2018-12-03 16:37:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:11,330 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 16:37:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:37:11,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-12-03 16:37:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:11,330 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:37:11,331 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:37:11,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 17 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:37:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:37:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:37:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:37:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 16:37:11,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-12-03 16:37:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:11,338 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 16:37:11,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:37:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 16:37:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:37:11,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:11,339 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2018-12-03 16:37:11,339 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:11,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2054811054, now seen corresponding path program 16 times [2018-12-03 16:37:11,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:11,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:11,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:11,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:11,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:12,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:12,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:12,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:12,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:12,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:12,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:12,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:12,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:12,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:12,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:12,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 14 [2018-12-03 16:37:12,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:12,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:37:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:37:12,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:37:12,342 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-12-03 16:37:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:12,515 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 16:37:12,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:37:12,515 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-12-03 16:37:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:12,515 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:37:12,516 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:37:12,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:37:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:37:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-03 16:37:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:37:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 16:37:12,524 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 16:37:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:12,524 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 16:37:12,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:37:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 16:37:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:37:12,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:12,525 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2018-12-03 16:37:12,525 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:12,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1011600054, now seen corresponding path program 17 times [2018-12-03 16:37:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:12,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:12,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:12,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:12,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:13,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:13,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:13,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:13,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:13,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:13,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:37:13,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:13,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:13,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 16:37:13,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:13,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:37:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:37:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:37:13,632 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2018-12-03 16:37:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:13,932 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 16:37:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:37:13,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-12-03 16:37:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:13,932 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:37:13,932 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:37:13,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 19 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:37:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:37:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:37:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:37:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 16:37:13,940 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 16:37:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:13,940 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 16:37:13,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:37:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 16:37:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:37:13,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:13,941 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2018-12-03 16:37:13,941 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:13,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1011743873, now seen corresponding path program 18 times [2018-12-03 16:37:13,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:13,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:13,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:14,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:14,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:14,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:14,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:14,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:14,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:14,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:14,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:14,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:14,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:14,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:14,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 15 [2018-12-03 16:37:14,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:14,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:37:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:37:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:37:14,417 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 16 states. [2018-12-03 16:37:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:14,677 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-03 16:37:14,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:37:14,678 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-03 16:37:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:14,678 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:37:14,679 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:37:14,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:37:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:37:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-03 16:37:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:37:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 16:37:14,687 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-12-03 16:37:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:14,688 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 16:37:14,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:37:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 16:37:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:37:14,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:14,688 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2018-12-03 16:37:14,689 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:14,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1623186269, now seen corresponding path program 19 times [2018-12-03 16:37:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:14,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:14,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:15,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:15,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:15,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:15,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 16:37:15,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:15,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:15,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:15,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:15,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:15,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:15,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 16:37:15,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:15,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:37:15,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:37:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:37:15,486 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 24 states. [2018-12-03 16:37:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:16,273 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 16:37:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:37:16,273 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-12-03 16:37:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:16,273 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:37:16,274 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:37:16,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 21 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:37:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:37:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:37:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:37:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 16:37:16,282 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-03 16:37:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:16,282 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 16:37:16,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:37:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 16:37:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:37:16,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:16,283 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2018-12-03 16:37:16,284 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:16,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -803883834, now seen corresponding path program 20 times [2018-12-03 16:37:16,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:16,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:16,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:16,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:16,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:16,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:16,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:16,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:16,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:16,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:16,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:16,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:37:16,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:16,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:16,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:17,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:17,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 16 [2018-12-03 16:37:17,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:17,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:37:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:37:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:37:17,233 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-12-03 16:37:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:17,544 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 16:37:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:37:17,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-03 16:37:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:17,548 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:37:17,548 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:37:17,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:37:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:37:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 16:37:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:37:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 16:37:17,556 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 16:37:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:17,556 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 16:37:17,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:37:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 16:37:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:37:17,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:17,557 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2018-12-03 16:37:17,557 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:17,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 561682018, now seen corresponding path program 21 times [2018-12-03 16:37:17,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:17,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:17,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:17,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:17,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:17,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:17,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:17,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:17,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:17,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:17,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:17,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:18,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:18,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 16:37:18,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:18,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:37:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:37:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:37:18,568 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-12-03 16:37:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:18,939 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 16:37:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:37:18,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-12-03 16:37:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:18,940 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:37:18,940 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:37:18,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 23 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:37:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:37:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:37:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:37:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 16:37:18,949 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 16:37:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:18,949 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 16:37:18,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:37:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 16:37:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:37:18,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:18,950 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2018-12-03 16:37:18,950 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:18,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1490671705, now seen corresponding path program 22 times [2018-12-03 16:37:18,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:18,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:18,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:19,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:19,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:19,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:19,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:19,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:19,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:19,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:19,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:19,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:19,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:19,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:19,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2018-12-03 16:37:19,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:19,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:37:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:37:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:37:19,605 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2018-12-03 16:37:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:20,083 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-03 16:37:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:37:20,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-03 16:37:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:20,084 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:37:20,084 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:37:20,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:37:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:37:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-03 16:37:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:37:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 16:37:20,092 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-03 16:37:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:20,093 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 16:37:20,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:37:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 16:37:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:37:20,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:20,094 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2018-12-03 16:37:20,094 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:20,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1983635147, now seen corresponding path program 23 times [2018-12-03 16:37:20,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:20,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:20,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:20,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:20,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:20,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:20,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:20,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:20,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:20,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:20,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:20,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:37:20,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:20,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:20,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:21,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 16:37:21,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:21,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:37:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:37:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:37:21,766 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2018-12-03 16:37:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:22,230 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 16:37:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:37:22,230 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-12-03 16:37:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:22,230 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:37:22,231 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:37:22,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 56 SyntacticMatches, 25 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:37:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:37:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:37:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:37:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 16:37:22,238 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-12-03 16:37:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:22,238 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 16:37:22,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:37:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 16:37:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:37:22,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:22,239 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2018-12-03 16:37:22,239 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:22,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1073842142, now seen corresponding path program 24 times [2018-12-03 16:37:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:22,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:22,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:22,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:22,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:22,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:22,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:22,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:22,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:22,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:22,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:22,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:22,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:22,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:22,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:22,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:22,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:22,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 18 [2018-12-03 16:37:22,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:22,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:37:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:37:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:37:22,737 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 19 states. [2018-12-03 16:37:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:22,980 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 16:37:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:37:22,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-12-03 16:37:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:22,981 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:37:22,981 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:37:22,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:37:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:37:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 16:37:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:37:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 16:37:22,993 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 16:37:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:22,993 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 16:37:22,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:37:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 16:37:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:37:22,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:22,994 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2018-12-03 16:37:22,996 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:22,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080634, now seen corresponding path program 25 times [2018-12-03 16:37:22,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:22,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:22,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:23,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:23,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:23,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:23,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:23,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:23,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:23,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:23,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:23,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:23,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:24,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 16:37:24,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:24,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:37:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:37:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:37:24,054 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2018-12-03 16:37:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:24,536 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 16:37:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:37:24,536 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-12-03 16:37:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:24,537 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:37:24,537 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:37:24,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 27 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:37:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:37:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:37:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:37:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 16:37:24,545 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 16:37:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:24,545 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 16:37:24,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:37:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 16:37:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:37:24,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:24,546 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2018-12-03 16:37:24,546 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:24,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1190416335, now seen corresponding path program 26 times [2018-12-03 16:37:24,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:24,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:24,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:24,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:24,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:24,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:24,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:24,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:24,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:24,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:37:24,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:24,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:24,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:25,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:25,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 19 [2018-12-03 16:37:25,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:25,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:37:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:37:25,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:37:25,125 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 20 states. [2018-12-03 16:37:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:25,370 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-03 16:37:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:37:25,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-12-03 16:37:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:25,371 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:37:25,371 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:37:25,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:37:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:37:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-12-03 16:37:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:37:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 16:37:25,379 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-03 16:37:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:25,380 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 16:37:25,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:37:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 16:37:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:37:25,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:25,380 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2018-12-03 16:37:25,380 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:25,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1528863987, now seen corresponding path program 27 times [2018-12-03 16:37:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:25,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:25,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:25,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:25,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:25,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:25,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:25,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:25,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:25,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:25,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:25,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:25,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:25,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:25,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:26,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:26,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 16:37:26,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:26,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:37:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:37:26,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:37:26,348 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 32 states. [2018-12-03 16:37:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:26,846 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-12-03 16:37:26,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:37:26,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2018-12-03 16:37:26,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:26,847 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:37:26,847 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:37:26,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 64 SyntacticMatches, 29 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:37:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:37:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:37:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:37:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 16:37:26,854 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-03 16:37:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:26,854 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 16:37:26,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:37:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 16:37:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:37:26,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:26,855 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2018-12-03 16:37:26,856 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:26,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1594530058, now seen corresponding path program 28 times [2018-12-03 16:37:26,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:26,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:26,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:26,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:26,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:27,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:27,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:27,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:27,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:27,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:27,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:27,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:27,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:27,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:27,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:27,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:27,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 20 [2018-12-03 16:37:27,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:27,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:37:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:37:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:37:27,420 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-12-03 16:37:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:27,675 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 16:37:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:37:27,676 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-03 16:37:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:27,676 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:37:27,677 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:37:27,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:37:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:37:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-12-03 16:37:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:37:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 16:37:27,686 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 16:37:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:27,686 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 16:37:27,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:37:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 16:37:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:37:27,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:27,687 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2018-12-03 16:37:27,687 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:27,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash 959872146, now seen corresponding path program 29 times [2018-12-03 16:37:27,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:27,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:28,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:28,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:28,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:28,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:28,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:28,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:28,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:28,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:28,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:37:28,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:28,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:28,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:28,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:28,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 16:37:28,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:28,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:37:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:37:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:37:28,467 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 34 states. [2018-12-03 16:37:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:29,135 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 16:37:29,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:37:29,135 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2018-12-03 16:37:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:29,136 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:37:29,136 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:37:29,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 68 SyntacticMatches, 31 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:37:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:37:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:37:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:37:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 16:37:29,145 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 16:37:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:29,145 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 16:37:29,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:37:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 16:37:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:37:29,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:29,146 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2018-12-03 16:37:29,146 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:29,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:29,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1087929335, now seen corresponding path program 30 times [2018-12-03 16:37:29,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:29,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:29,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:29,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:29,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:29,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:29,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:29,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:29,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:29,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:29,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:29,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:29,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:29,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:29,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:29,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:29,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:29,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 21 [2018-12-03 16:37:29,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:29,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:37:29,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:37:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:37:29,937 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 22 states. [2018-12-03 16:37:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:30,256 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-03 16:37:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:37:30,257 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 16:37:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:30,257 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:37:30,258 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:37:30,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:37:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:37:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 16:37:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:37:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 16:37:30,269 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2018-12-03 16:37:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:30,269 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 16:37:30,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:37:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 16:37:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:37:30,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:30,270 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2018-12-03 16:37:30,270 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:30,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1823104795, now seen corresponding path program 31 times [2018-12-03 16:37:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:30,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:30,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:30,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:30,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:30,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:30,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:30,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:30,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:30,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:30,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:30,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:30,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 16:37:31,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:31,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:37:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:37:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:37:31,411 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 36 states. [2018-12-03 16:37:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:32,169 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 16:37:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:37:32,169 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2018-12-03 16:37:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:32,170 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:37:32,170 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:37:32,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 72 SyntacticMatches, 33 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:37:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:37:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:37:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:37:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 16:37:32,179 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-12-03 16:37:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:32,179 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 16:37:32,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:37:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 16:37:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:37:32,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:32,180 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2018-12-03 16:37:32,181 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:32,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2133414414, now seen corresponding path program 32 times [2018-12-03 16:37:32,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:32,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:32,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:32,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:32,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:32,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:32,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:32,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:32,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:32,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:32,528 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:32,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:37:32,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:32,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:32,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:32,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:32,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 22 [2018-12-03 16:37:32,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:32,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:37:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:37:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:37:32,890 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2018-12-03 16:37:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:33,218 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 16:37:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:37:33,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-12-03 16:37:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:33,220 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:37:33,220 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:37:33,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:37:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:37:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-03 16:37:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:37:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 16:37:33,230 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 16:37:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:33,231 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 16:37:33,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:37:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 16:37:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:37:33,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:33,231 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2018-12-03 16:37:33,232 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:33,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1511784874, now seen corresponding path program 33 times [2018-12-03 16:37:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:33,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:33,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:33,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:33,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:33,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:33,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:33,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:33,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:33,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:33,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:33,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:33,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:33,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:33,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:34,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:34,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 16:37:34,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:34,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:37:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:37:34,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:37:34,397 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 38 states. [2018-12-03 16:37:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:35,107 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-12-03 16:37:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:37:35,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2018-12-03 16:37:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:35,108 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:37:35,108 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:37:35,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 76 SyntacticMatches, 35 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:37:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:37:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:37:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:37:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 16:37:35,118 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 16:37:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 16:37:35,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:37:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 16:37:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:37:35,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:35,119 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2018-12-03 16:37:35,119 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:35,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash -906931231, now seen corresponding path program 34 times [2018-12-03 16:37:35,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:35,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:35,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:35,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:35,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:35,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:35,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:35,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:35,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:35,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:35,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:35,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:35,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:35,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:35,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 23 [2018-12-03 16:37:35,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:35,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:37:35,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:37:35,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:37:35,999 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 24 states. [2018-12-03 16:37:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:36,476 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-03 16:37:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:37:36,477 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-12-03 16:37:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:36,477 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:37:36,477 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:37:36,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=674, Invalid=1132, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:37:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:37:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 16:37:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:37:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 16:37:36,488 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-12-03 16:37:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:36,488 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 16:37:36,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:37:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 16:37:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:37:36,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:36,489 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2018-12-03 16:37:36,489 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:36,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 317381309, now seen corresponding path program 35 times [2018-12-03 16:37:36,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:36,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:37,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:37,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:37,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:37,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:37,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:37,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:37,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:37,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:37:37,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:37,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:37,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:37,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:37,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 16:37:37,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:37,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:37:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:37:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:37:37,964 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 40 states. [2018-12-03 16:37:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:38,741 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 16:37:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:37:38,741 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2018-12-03 16:37:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:38,742 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:37:38,742 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:37:38,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 37 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:37:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:37:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:37:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:37:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 16:37:38,757 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-03 16:37:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:38,757 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 16:37:38,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:37:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 16:37:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:37:38,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:38,758 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2018-12-03 16:37:38,758 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:38,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1012222246, now seen corresponding path program 36 times [2018-12-03 16:37:38,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:38,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:38,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:39,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:39,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:39,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:39,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 16:37:39,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:39,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:39,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:39,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:39,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:39,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:39,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:39,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:39,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 24 [2018-12-03 16:37:39,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:39,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:37:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:37:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:37:39,753 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 25 states. [2018-12-03 16:37:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:40,140 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 16:37:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:37:40,141 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 16:37:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:40,142 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:37:40,142 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:37:40,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:37:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:37:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 16:37:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:37:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 16:37:40,157 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 16:37:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:40,158 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 16:37:40,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:37:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 16:37:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:37:40,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:40,158 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2018-12-03 16:37:40,158 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:40,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2082902722, now seen corresponding path program 37 times [2018-12-03 16:37:40,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:40,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:40,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:40,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:40,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:40,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:40,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:40,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:40,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:40,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:40,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:40,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:40,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:40,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:40,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:41,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:41,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 16:37:41,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:41,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:37:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:37:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:37:41,700 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 42 states. [2018-12-03 16:37:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:42,939 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 16:37:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:37:42,939 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-12-03 16:37:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:42,940 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:37:42,940 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:37:42,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 84 SyntacticMatches, 39 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:37:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:37:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:37:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:37:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 16:37:42,951 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 16:37:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:42,951 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 16:37:42,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:37:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 16:37:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:37:42,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:42,952 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2018-12-03 16:37:42,952 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:42,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:42,952 INFO L82 PathProgramCache]: Analyzing trace with hash 346890169, now seen corresponding path program 38 times [2018-12-03 16:37:42,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:42,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:42,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:42,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:42,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:43,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:43,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:43,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:43,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:43,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:43,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:43,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:43,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:43,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:37:43,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:43,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:43,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:43,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:43,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 25 [2018-12-03 16:37:43,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:43,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:37:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:37:43,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:37:43,774 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-12-03 16:37:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:44,697 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-03 16:37:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:37:44,697 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-12-03 16:37:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:44,698 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:37:44,698 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:37:44,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=807, Invalid=1355, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:37:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:37:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-03 16:37:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:37:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 16:37:44,711 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-12-03 16:37:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:44,711 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 16:37:44,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:37:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 16:37:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:37:44,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:44,712 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2018-12-03 16:37:44,712 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:44,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1646063467, now seen corresponding path program 39 times [2018-12-03 16:37:44,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:44,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:44,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:45,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:45,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:45,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:45,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:45,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:45,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:45,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:45,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:45,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:45,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:45,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:45,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:46,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:46,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 16:37:46,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:46,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:37:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:37:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:37:46,139 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 44 states. [2018-12-03 16:37:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:46,990 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-12-03 16:37:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:37:46,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2018-12-03 16:37:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:46,991 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:37:46,991 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:37:46,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 88 SyntacticMatches, 41 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:37:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:37:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:37:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:37:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 16:37:47,003 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-12-03 16:37:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:47,004 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 16:37:47,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:37:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 16:37:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:37:47,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:47,004 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2018-12-03 16:37:47,004 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:47,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 800148542, now seen corresponding path program 40 times [2018-12-03 16:37:47,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:47,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:47,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:47,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:47,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:47,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:47,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:47,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:47,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:47,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:47,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:47,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:48,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:48,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 26 [2018-12-03 16:37:48,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:48,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:37:48,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:37:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:37:48,445 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2018-12-03 16:37:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:48,842 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 16:37:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:37:48,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-12-03 16:37:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:48,843 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:37:48,843 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:37:48,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 42 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:37:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:37:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 16:37:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:37:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 16:37:48,861 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 16:37:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:48,861 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 16:37:48,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:37:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 16:37:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:37:48,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:48,862 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2018-12-03 16:37:48,862 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:48,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 143536090, now seen corresponding path program 41 times [2018-12-03 16:37:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:48,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:48,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:49,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:49,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:49,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:49,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:49,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:49,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:49,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:49,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:37:49,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:49,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:49,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:50,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:50,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 16:37:50,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:50,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:37:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:37:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:37:50,282 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 46 states. [2018-12-03 16:37:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:51,309 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 16:37:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:37:51,309 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2018-12-03 16:37:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:51,310 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:37:51,310 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:37:51,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 92 SyntacticMatches, 43 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:37:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:37:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:37:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:37:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 16:37:51,321 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 16:37:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:51,322 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 16:37:51,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:37:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 16:37:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:37:51,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:51,322 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2018-12-03 16:37:51,322 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:51,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1759582319, now seen corresponding path program 42 times [2018-12-03 16:37:51,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:51,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:51,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:51,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:51,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:51,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:51,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:51,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:51,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:51,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:51,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:51,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:51,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:52,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:52,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:52,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2018-12-03 16:37:52,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:52,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:37:52,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:37:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:37:52,421 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 28 states. [2018-12-03 16:37:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:52,978 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-12-03 16:37:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:37:52,978 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-12-03 16:37:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:52,979 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:37:52,979 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:37:52,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 113 SyntacticMatches, 44 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:37:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:37:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-03 16:37:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:37:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 16:37:52,995 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-12-03 16:37:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:52,995 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 16:37:52,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:37:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 16:37:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:37:52,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:52,996 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2018-12-03 16:37:52,996 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:52,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1258439277, now seen corresponding path program 43 times [2018-12-03 16:37:52,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:52,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:52,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:53,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:53,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:53,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:53,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:53,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:53,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:53,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:53,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:53,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:53,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 16:37:54,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:54,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:37:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:37:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:37:54,527 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 48 states. [2018-12-03 16:37:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:55,341 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 16:37:55,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:37:55,341 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2018-12-03 16:37:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:55,341 INFO L225 Difference]: With dead ends: 122 [2018-12-03 16:37:55,342 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:37:55,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 96 SyntacticMatches, 45 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:37:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:37:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:37:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:37:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 16:37:55,358 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-03 16:37:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:55,358 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 16:37:55,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:37:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 16:37:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:37:55,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:55,359 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2018-12-03 16:37:55,359 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:55,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash -973776042, now seen corresponding path program 44 times [2018-12-03 16:37:55,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:55,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:55,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:55,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:55,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:56,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:56,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:56,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:56,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:56,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:56,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:37:56,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:56,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:56,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:37:56,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:56,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:56,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:57,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:57,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 28 [2018-12-03 16:37:57,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:57,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:37:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:37:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:37:57,039 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 29 states. [2018-12-03 16:37:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:57,473 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 16:37:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:37:57,474 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-12-03 16:37:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:57,475 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:37:57,475 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:37:57,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:37:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:37:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 16:37:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:37:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 16:37:57,491 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 16:37:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:57,491 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 16:37:57,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:37:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 16:37:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:37:57,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:57,491 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2018-12-03 16:37:57,492 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:57,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash 504027378, now seen corresponding path program 45 times [2018-12-03 16:37:57,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:57,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:57,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:57,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:57,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:58,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:58,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:58,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:58,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:58,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:58,379 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 16:37:58,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:58,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:58,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:58,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:58,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:58,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:37:59,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:59,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 16:37:59,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:59,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:37:59,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:37:59,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:37:59,547 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 50 states. [2018-12-03 16:38:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:00,731 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 16:38:00,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:38:00,731 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2018-12-03 16:38:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:00,732 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:38:00,732 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:38:00,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 100 SyntacticMatches, 47 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:38:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:38:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:38:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:38:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 16:38:00,749 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 16:38:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:00,749 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 16:38:00,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:38:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 16:38:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:38:00,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:00,749 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2018-12-03 16:38:00,750 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:00,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash -443896983, now seen corresponding path program 46 times [2018-12-03 16:38:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:00,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:00,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:00,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:02,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:02,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:02,812 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:02,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:02,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:02,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:02,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:02,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:02,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:02,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 29 [2018-12-03 16:38:03,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:03,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:38:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:38:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:38:03,422 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 30 states. [2018-12-03 16:38:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:03,912 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-03 16:38:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:38:03,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-12-03 16:38:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:03,913 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:38:03,913 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:38:03,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 123 SyntacticMatches, 48 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1109, Invalid=1861, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:38:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:38:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-03 16:38:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:38:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 16:38:03,931 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-12-03 16:38:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:03,931 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 16:38:03,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:38:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 16:38:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:38:03,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:03,932 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2018-12-03 16:38:03,932 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:03,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1383305147, now seen corresponding path program 47 times [2018-12-03 16:38:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:03,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:04,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:04,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:04,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:04,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:04,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:04,788 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 16:38:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:04,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:04,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:38:04,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:04,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:04,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:06,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:06,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:38:06,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:06,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:38:06,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:38:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:38:06,608 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 52 states. [2018-12-03 16:38:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:08,127 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 16:38:08,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:38:08,128 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2018-12-03 16:38:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:08,128 INFO L225 Difference]: With dead ends: 132 [2018-12-03 16:38:08,128 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:38:08,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 104 SyntacticMatches, 49 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:38:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:38:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:38:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:38:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 16:38:08,150 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-12-03 16:38:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:08,151 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 16:38:08,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:38:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 16:38:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:38:08,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:08,151 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2018-12-03 16:38:08,152 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:08,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1587972498, now seen corresponding path program 48 times [2018-12-03 16:38:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:08,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:08,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:08,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:08,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:08,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:08,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:08,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:08,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:08,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:08,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:08,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:08,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:09,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:09,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:09,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:09,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 30 [2018-12-03 16:38:09,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:09,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:38:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:38:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:38:09,679 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 31 states. [2018-12-03 16:38:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:10,420 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 16:38:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:38:10,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-12-03 16:38:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:10,421 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:38:10,421 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:38:10,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 128 SyntacticMatches, 50 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:38:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:38:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-12-03 16:38:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:38:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 16:38:10,439 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 16:38:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:10,439 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 16:38:10,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:38:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 16:38:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:38:10,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:10,440 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2018-12-03 16:38:10,440 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:10,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1328247286, now seen corresponding path program 49 times [2018-12-03 16:38:10,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:10,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:10,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:12,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:12,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:12,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:12,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:12,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:12,533 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 16:38:12,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:12,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:12,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:12,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:38:13,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:13,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:38:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:38:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:38:13,410 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 54 states. [2018-12-03 16:38:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:14,845 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 16:38:14,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:38:14,845 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2018-12-03 16:38:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:14,846 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:38:14,846 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:38:14,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 108 SyntacticMatches, 51 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:38:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:38:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:38:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:38:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 16:38:14,869 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 16:38:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:14,869 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 16:38:14,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:38:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 16:38:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:38:14,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:14,870 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2018-12-03 16:38:14,870 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:14,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 280259393, now seen corresponding path program 50 times [2018-12-03 16:38:14,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:14,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:15,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:15,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:15,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:15,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 16:38:15,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:15,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 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 16:38:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:15,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:15,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:38:15,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:15,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:15,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:16,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:16,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 31 [2018-12-03 16:38:16,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:16,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:38:16,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:38:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:38:16,125 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 32 states. [2018-12-03 16:38:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:17,568 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-12-03 16:38:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:38:17,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-12-03 16:38:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:17,569 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:38:17,569 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:38:17,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 133 SyntacticMatches, 52 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:38:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:38:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-03 16:38:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:38:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 16:38:17,587 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2018-12-03 16:38:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:17,587 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 16:38:17,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:38:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 16:38:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:38:17,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:17,588 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2018-12-03 16:38:17,588 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:17,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1253729763, now seen corresponding path program 51 times [2018-12-03 16:38:17,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:17,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:17,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:18,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:18,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:18,747 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:18,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:18,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:18,748 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 16:38:18,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:18,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:18,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:18,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:18,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:18,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:19,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:19,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 16:38:19,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:19,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:38:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:38:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:38:19,725 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 56 states. [2018-12-03 16:38:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:21,241 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-12-03 16:38:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:38:21,241 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2018-12-03 16:38:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:21,241 INFO L225 Difference]: With dead ends: 142 [2018-12-03 16:38:21,241 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:38:21,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 112 SyntacticMatches, 53 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:38:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:38:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:38:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:38:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 16:38:21,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-03 16:38:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:21,260 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 16:38:21,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:38:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 16:38:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:38:21,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:21,261 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2018-12-03 16:38:21,261 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:21,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1181377146, now seen corresponding path program 52 times [2018-12-03 16:38:21,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:21,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:21,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:21,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:21,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:21,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:21,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:21,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:21,757 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 16:38:21,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:21,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:21,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:21,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:22,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:22,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 32 [2018-12-03 16:38:22,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:22,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:38:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:38:22,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:38:22,875 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 33 states. [2018-12-03 16:38:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:23,428 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 16:38:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:38:23,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-12-03 16:38:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:23,429 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:38:23,430 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:38:23,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 138 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:38:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:38:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-12-03 16:38:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:38:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 16:38:23,449 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 16:38:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:23,449 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 16:38:23,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:38:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 16:38:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:38:23,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:23,450 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2018-12-03 16:38:23,450 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:23,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1432137950, now seen corresponding path program 53 times [2018-12-03 16:38:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:23,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:24,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:24,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:24,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:24,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:24,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:24,644 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 16:38:24,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:24,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:24,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:38:24,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:24,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:24,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:25,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:25,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 16:38:25,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:25,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:38:25,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:38:25,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:38:25,813 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 58 states. [2018-12-03 16:38:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:27,664 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 16:38:27,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:38:27,664 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 86 [2018-12-03 16:38:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:27,665 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:38:27,665 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:38:27,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 116 SyntacticMatches, 55 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:38:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:38:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:38:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:38:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 16:38:27,686 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 16:38:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:27,687 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 16:38:27,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:38:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 16:38:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:38:27,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:27,687 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2018-12-03 16:38:27,688 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:27,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2048907495, now seen corresponding path program 54 times [2018-12-03 16:38:27,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:27,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:27,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:28,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:28,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:28,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:28,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:28,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:28,672 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 16:38:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:28,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:28,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:28,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:28,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:28,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:29,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:29,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 33 [2018-12-03 16:38:29,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:29,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:38:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:38:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:38:29,459 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 34 states. [2018-12-03 16:38:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:30,017 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-12-03 16:38:30,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:38:30,018 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-12-03 16:38:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:30,019 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:38:30,019 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:38:30,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 143 SyntacticMatches, 56 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:38:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:38:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-03 16:38:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:38:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 16:38:30,047 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2018-12-03 16:38:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:30,047 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 16:38:30,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:38:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 16:38:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:38:30,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:30,048 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2018-12-03 16:38:30,049 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:30,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1905147915, now seen corresponding path program 55 times [2018-12-03 16:38:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:30,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:30,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:31,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:31,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:31,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:31,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 16:38:31,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:31,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 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 16:38:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:31,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:31,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:31,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 16:38:32,131 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:32,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:38:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:38:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:38:32,132 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 60 states. [2018-12-03 16:38:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:33,990 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 16:38:33,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:38:33,990 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2018-12-03 16:38:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:33,991 INFO L225 Difference]: With dead ends: 152 [2018-12-03 16:38:33,991 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:38:33,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 120 SyntacticMatches, 57 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:38:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:38:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:38:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:38:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 16:38:34,021 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-12-03 16:38:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:34,022 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 16:38:34,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:38:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 16:38:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:38:34,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:34,022 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2018-12-03 16:38:34,023 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:34,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2078396574, now seen corresponding path program 56 times [2018-12-03 16:38:34,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:34,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:34,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:34,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:34,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:34,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:34,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:34,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:34,917 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 16:38:34,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:34,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:35,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:38:35,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:35,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:35,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:35,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:35,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 34 [2018-12-03 16:38:35,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:35,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:38:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:38:35,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:38:35,910 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 35 states. [2018-12-03 16:38:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:36,571 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 16:38:36,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:38:36,572 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-12-03 16:38:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:36,573 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:38:36,573 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:38:36,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 58 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:38:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:38:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-03 16:38:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:38:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 16:38:36,599 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 16:38:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:36,600 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 16:38:36,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:38:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 16:38:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:38:36,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:36,601 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2018-12-03 16:38:36,601 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:36,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash 179248186, now seen corresponding path program 57 times [2018-12-03 16:38:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:36,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:36,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:36,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:36,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:38,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:38,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:38,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,094 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 16:38:38,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:38,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:38,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:38,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:38,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:39,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 16:38:39,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:39,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:38:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:38:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:38:39,242 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 62 states. [2018-12-03 16:38:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:40,886 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-12-03 16:38:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:38:40,886 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 92 [2018-12-03 16:38:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:40,887 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:38:40,887 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:38:40,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 124 SyntacticMatches, 59 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:38:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:38:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:38:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:38:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 16:38:40,908 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 16:38:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:40,908 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 16:38:40,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:38:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 16:38:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:38:40,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:40,909 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2018-12-03 16:38:40,909 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:40,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash -288235791, now seen corresponding path program 58 times [2018-12-03 16:38:40,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:41,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:41,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:41,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:41,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,442 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 16:38:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:41,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:41,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:42,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:42,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 35 [2018-12-03 16:38:42,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:42,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:38:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:38:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:42,382 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 36 states. [2018-12-03 16:38:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:43,176 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-12-03 16:38:43,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:38:43,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-12-03 16:38:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:43,178 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:38:43,178 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:38:43,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 153 SyntacticMatches, 60 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:38:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:38:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-12-03 16:38:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:38:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 16:38:43,202 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-12-03 16:38:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:43,202 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 16:38:43,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:38:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 16:38:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:38:43,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:43,202 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2018-12-03 16:38:43,203 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:43,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2116754995, now seen corresponding path program 59 times [2018-12-03 16:38:43,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:43,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:44,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:44,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:44,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:44,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,512 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 16:38:44,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:44,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:44,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:38:44,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:44,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:44,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:45,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:45,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 16:38:45,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:45,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:38:45,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:38:45,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:38:45,851 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 64 states. [2018-12-03 16:38:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:47,956 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 16:38:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:38:47,957 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2018-12-03 16:38:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:47,957 INFO L225 Difference]: With dead ends: 162 [2018-12-03 16:38:47,957 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:38:47,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 128 SyntacticMatches, 61 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:38:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:38:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:38:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:38:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 16:38:47,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-03 16:38:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:47,979 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 16:38:47,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:38:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 16:38:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:38:47,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:47,980 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2018-12-03 16:38:47,980 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:47,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash -352972874, now seen corresponding path program 60 times [2018-12-03 16:38:47,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:47,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:47,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:48,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:48,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:48,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:48,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:48,542 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 16:38:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:48,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:48,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:48,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:48,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:48,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:49,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:49,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 36 [2018-12-03 16:38:49,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:49,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:38:49,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:38:49,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:38:49,444 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 37 states. [2018-12-03 16:38:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:50,145 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 16:38:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:38:50,145 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-12-03 16:38:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:50,146 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:38:50,146 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:38:50,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 158 SyntacticMatches, 62 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:38:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:38:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-03 16:38:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:38:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 16:38:50,171 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 16:38:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:50,171 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 16:38:50,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:38:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 16:38:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:38:50,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:50,172 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2018-12-03 16:38:50,172 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:50,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 95417682, now seen corresponding path program 61 times [2018-12-03 16:38:50,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:51,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:51,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:51,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:51,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:51,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:51,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:51,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:51,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:51,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:51,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:53,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:53,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 16:38:53,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:53,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:38:53,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:38:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:38:53,209 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 66 states. [2018-12-03 16:38:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:55,198 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 16:38:55,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:38:55,198 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 98 [2018-12-03 16:38:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:55,199 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:38:55,199 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:38:55,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 132 SyntacticMatches, 63 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3410 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:38:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:38:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:38:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:38:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 16:38:55,223 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 16:38:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:55,223 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 16:38:55,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:38:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 16:38:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:38:55,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:55,224 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2018-12-03 16:38:55,224 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:55,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:55,224 INFO L82 PathProgramCache]: Analyzing trace with hash 298685129, now seen corresponding path program 62 times [2018-12-03 16:38:55,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:55,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:55,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:55,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:55,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:55,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:55,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:55,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:55,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:55,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:55,788 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 16:38:55,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:55,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:56,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:38:56,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:56,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:56,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:57,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:57,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 37 [2018-12-03 16:38:57,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:57,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:38:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:38:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:38:57,126 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 38 states. [2018-12-03 16:38:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:57,854 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2018-12-03 16:38:57,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:38:57,854 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-03 16:38:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:57,855 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:38:57,855 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:38:57,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:38:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:38:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-03 16:38:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:38:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 16:38:57,885 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-12-03 16:38:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:57,885 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 16:38:57,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:38:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 16:38:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:38:57,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:57,886 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2018-12-03 16:38:57,886 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:57,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash -726466651, now seen corresponding path program 63 times [2018-12-03 16:38:57,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:57,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:57,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:59,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:59,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:59,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:59,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 16:38:59,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:59,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:59,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:59,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:59,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:59,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:59,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:59,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:01,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:01,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 16:39:01,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:39:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:39:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:39:01,896 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 68 states. [2018-12-03 16:39:04,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:04,415 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 16:39:04,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:39:04,415 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 101 [2018-12-03 16:39:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:04,416 INFO L225 Difference]: With dead ends: 172 [2018-12-03 16:39:04,416 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:39:04,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 136 SyntacticMatches, 65 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:39:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:39:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:39:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:39:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 16:39:04,444 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-12-03 16:39:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:04,445 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 16:39:04,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:39:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 16:39:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:39:04,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:04,446 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2018-12-03 16:39:04,446 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:04,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1089840434, now seen corresponding path program 64 times [2018-12-03 16:39:04,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:04,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:04,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:04,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:04,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:05,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:05,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:05,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:05,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:05,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:05,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:05,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:05,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:05,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:06,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:06,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 38 [2018-12-03 16:39:06,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:06,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:39:06,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:39:06,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:39:06,026 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-12-03 16:39:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:06,778 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 16:39:06,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:39:06,778 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-12-03 16:39:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:06,779 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:39:06,779 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:39:06,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 168 SyntacticMatches, 66 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:39:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:39:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 16:39:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:39:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 16:39:06,808 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 16:39:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:06,808 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 16:39:06,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:39:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 16:39:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:39:06,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:06,808 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2018-12-03 16:39:06,809 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:06,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 635296362, now seen corresponding path program 65 times [2018-12-03 16:39:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:06,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:06,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:08,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:08,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:08,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:08,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 16:39:08,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:08,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:08,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:08,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:39:08,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:08,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:08,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:09,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:09,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 16:39:09,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:09,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:39:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:39:09,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:39:09,827 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 70 states. [2018-12-03 16:39:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:12,170 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 16:39:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:39:12,170 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 104 [2018-12-03 16:39:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:12,171 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:39:12,171 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:39:12,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 140 SyntacticMatches, 67 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:39:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:39:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:39:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:39:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 16:39:12,208 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 16:39:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:12,208 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 16:39:12,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:39:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 16:39:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:39:12,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:12,209 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2018-12-03 16:39:12,210 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:12,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1315487071, now seen corresponding path program 66 times [2018-12-03 16:39:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:12,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:12,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:12,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:12,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:12,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:12,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:12,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:12,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:12,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:12,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:12,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:12,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:12,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:12,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:14,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 39 [2018-12-03 16:39:14,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:14,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:39:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:39:14,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:39:14,313 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 40 states. [2018-12-03 16:39:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:15,065 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-12-03 16:39:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:39:15,066 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 16:39:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:15,067 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:39:15,067 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:39:15,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 173 SyntacticMatches, 68 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:39:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:39:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-03 16:39:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:39:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 16:39:15,096 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2018-12-03 16:39:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:15,096 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 16:39:15,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:39:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 16:39:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:39:15,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:15,097 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2018-12-03 16:39:15,097 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:15,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1462756995, now seen corresponding path program 67 times [2018-12-03 16:39:15,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:15,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:15,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:15,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:15,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:16,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:16,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:16,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:16,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:16,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:16,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:16,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:16,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:16,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:16,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 16:39:17,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:17,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:39:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:39:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:39:17,971 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 72 states. [2018-12-03 16:39:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:20,698 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 16:39:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:39:20,698 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 107 [2018-12-03 16:39:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:20,699 INFO L225 Difference]: With dead ends: 182 [2018-12-03 16:39:20,699 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:39:20,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 144 SyntacticMatches, 69 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:39:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:39:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:39:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:39:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 16:39:20,727 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-03 16:39:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:20,727 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 16:39:20,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:39:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 16:39:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:39:20,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:20,728 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2018-12-03 16:39:20,728 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:20,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2049527322, now seen corresponding path program 68 times [2018-12-03 16:39:20,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:20,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:20,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:20,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:21,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:21,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:21,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:21,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:21,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:21,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:21,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:21,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:39:21,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:21,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:21,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 40 [2018-12-03 16:39:22,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:22,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:39:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:39:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:39:22,445 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 41 states. [2018-12-03 16:39:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:23,252 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 16:39:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:39:23,252 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 108 [2018-12-03 16:39:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:23,253 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:39:23,253 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:39:23,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 178 SyntacticMatches, 70 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:39:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:39:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-03 16:39:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:39:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 16:39:23,281 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 16:39:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:23,281 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 16:39:23,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:39:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 16:39:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:39:23,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:23,282 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2018-12-03 16:39:23,282 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:23,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:23,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1794165634, now seen corresponding path program 69 times [2018-12-03 16:39:23,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:23,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:23,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:23,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:23,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:25,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:25,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:25,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:25,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:25,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:25,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:25,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:25,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:25,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:25,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:25,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:25,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:26,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:26,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 16:39:26,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:26,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:39:26,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:39:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:39:26,556 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 74 states. [2018-12-03 16:39:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:29,408 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 16:39:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:39:29,408 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2018-12-03 16:39:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:29,409 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:39:29,409 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:39:29,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 148 SyntacticMatches, 71 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4340 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:39:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:39:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:39:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:39:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 16:39:29,439 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 16:39:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:29,439 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 16:39:29,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:39:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 16:39:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:39:29,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:29,440 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2018-12-03 16:39:29,440 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:29,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1836248697, now seen corresponding path program 70 times [2018-12-03 16:39:29,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:29,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:29,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:29,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:29,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:30,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:30,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:30,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:30,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:30,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:30,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:30,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:30,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:30,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:30,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 41 [2018-12-03 16:39:31,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:39:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:39:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:39:31,481 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 42 states. [2018-12-03 16:39:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:32,277 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-12-03 16:39:32,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:39:32,278 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 16:39:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:32,278 INFO L225 Difference]: With dead ends: 120 [2018-12-03 16:39:32,279 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 16:39:32,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 183 SyntacticMatches, 72 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:39:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 16:39:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-03 16:39:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:39:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 16:39:32,314 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2018-12-03 16:39:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 16:39:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:39:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 16:39:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:39:32,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:32,315 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2018-12-03 16:39:32,315 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:32,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -596627627, now seen corresponding path program 71 times [2018-12-03 16:39:32,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:32,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:32,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:34,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:34,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:34,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:34,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:34,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:34,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:34,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:34,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:39:34,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:34,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:34,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 16:39:35,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:35,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:39:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:39:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:39:35,867 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 76 states. [2018-12-03 16:39:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:38,569 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 16:39:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:39:38,569 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2018-12-03 16:39:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:38,570 INFO L225 Difference]: With dead ends: 192 [2018-12-03 16:39:38,570 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:39:38,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 152 SyntacticMatches, 73 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4590 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:39:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:39:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:39:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:39:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 16:39:38,601 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-12-03 16:39:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:38,601 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 16:39:38,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:39:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 16:39:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:39:38,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:38,602 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2018-12-03 16:39:38,602 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:38,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1030548226, now seen corresponding path program 72 times [2018-12-03 16:39:38,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:38,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:38,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:39,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:39,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:39,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:39,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:39,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:39,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:39,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:39,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:39,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:39,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:39,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:39,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:40,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:40,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 42 [2018-12-03 16:39:40,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:40,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:39:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:39:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:39:40,911 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 43 states. [2018-12-03 16:39:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:41,753 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 16:39:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:39:41,753 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-12-03 16:39:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:41,754 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:39:41,754 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:39:41,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 188 SyntacticMatches, 74 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:39:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:39:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-12-03 16:39:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:39:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 16:39:41,788 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 16:39:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:41,788 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 16:39:41,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:39:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 16:39:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:39:41,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:41,788 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2018-12-03 16:39:41,789 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:41,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1780533402, now seen corresponding path program 73 times [2018-12-03 16:39:41,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:41,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:43,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:43,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:43,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:43,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 16:39:43,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:43,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:43,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:43,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:43,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:43,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 16:39:45,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:45,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:39:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:39:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:39:45,420 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 78 states. [2018-12-03 16:39:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:48,308 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 16:39:48,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:39:48,308 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 116 [2018-12-03 16:39:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:48,309 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:39:48,309 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 16:39:48,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 156 SyntacticMatches, 75 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:39:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 16:39:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 16:39:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:39:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 16:39:48,342 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 16:39:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:48,342 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 16:39:48,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:39:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 16:39:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 16:39:48,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:48,343 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2018-12-03 16:39:48,343 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:48,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1591437743, now seen corresponding path program 74 times [2018-12-03 16:39:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:48,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:49,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:49,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:49,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:49,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:49,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:49,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:49,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:49,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:49,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:39:49,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:49,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:49,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:50,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:50,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 43 [2018-12-03 16:39:50,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:50,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:39:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:39:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:39:50,870 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 44 states. [2018-12-03 16:39:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:51,744 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-12-03 16:39:51,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:39:51,744 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 117 [2018-12-03 16:39:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:51,745 INFO L225 Difference]: With dead ends: 126 [2018-12-03 16:39:51,745 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:39:51,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 193 SyntacticMatches, 76 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:39:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:39:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-12-03 16:39:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:39:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 16:39:51,779 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-12-03 16:39:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:51,780 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 16:39:51,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:39:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 16:39:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 16:39:51,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:51,780 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2018-12-03 16:39:51,780 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:51,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash -363380435, now seen corresponding path program 75 times [2018-12-03 16:39:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:51,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:51,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:53,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:53,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:53,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:53,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:53,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:53,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:53,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:53,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:53,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:53,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:53,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:53,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:55,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:55,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 16:39:55,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:55,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:39:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:39:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:39:55,617 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 80 states. [2018-12-03 16:39:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:58,467 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-12-03 16:39:58,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:39:58,468 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 119 [2018-12-03 16:39:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:58,468 INFO L225 Difference]: With dead ends: 202 [2018-12-03 16:39:58,468 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:39:58,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 160 SyntacticMatches, 77 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5111 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:39:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:39:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 16:39:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:39:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 16:39:58,502 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2018-12-03 16:39:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:58,503 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 16:39:58,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:39:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 16:39:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:39:58,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:58,503 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2018-12-03 16:39:58,504 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:58,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash 234325014, now seen corresponding path program 76 times [2018-12-03 16:39:58,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:58,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:58,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:59,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:59,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:59,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:59,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:59,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:59,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:59,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:59,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:59,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:59,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:00,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:00,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 44 [2018-12-03 16:40:00,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:00,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:40:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:40:00,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:40:00,691 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 45 states. [2018-12-03 16:40:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:01,583 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 16:40:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:40:01,584 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 120 [2018-12-03 16:40:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:01,584 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:40:01,585 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:40:01,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 198 SyntacticMatches, 78 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 16:40:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:40:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-12-03 16:40:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:40:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 16:40:01,621 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 16:40:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:01,621 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 16:40:01,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:40:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 16:40:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:40:01,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:01,622 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2018-12-03 16:40:01,622 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:01,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1847972274, now seen corresponding path program 77 times [2018-12-03 16:40:01,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:01,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:01,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:03,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:03,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:03,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:03,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:03,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:03,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:03,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:03,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:03,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:40:03,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:03,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:03,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:05,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 81 [2018-12-03 16:40:05,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:05,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:40:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:40:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:40:05,648 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 82 states. [2018-12-03 16:40:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:09,003 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 16:40:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:40:09,003 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 122 [2018-12-03 16:40:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:09,003 INFO L225 Difference]: With dead ends: 207 [2018-12-03 16:40:09,004 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:40:09,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 164 SyntacticMatches, 79 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5382 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:40:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:40:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 16:40:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:40:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 16:40:09,040 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 16:40:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:09,040 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 16:40:09,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:40:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 16:40:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:40:09,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:09,041 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2018-12-03 16:40:09,041 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:09,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1156594217, now seen corresponding path program 78 times [2018-12-03 16:40:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:09,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:09,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:09,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:09,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:10,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:10,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:10,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:10,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:10,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:10,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:10,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:10,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:10,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:10,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:10,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:10,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:11,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:11,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 45 [2018-12-03 16:40:11,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:11,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:40:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:40:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:40:11,502 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 46 states. [2018-12-03 16:40:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:12,440 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-12-03 16:40:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:40:12,440 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2018-12-03 16:40:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:12,441 INFO L225 Difference]: With dead ends: 132 [2018-12-03 16:40:12,442 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:40:12,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 203 SyntacticMatches, 80 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 16:40:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:40:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-03 16:40:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:40:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 16:40:12,496 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-12-03 16:40:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:12,496 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 16:40:12,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:40:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 16:40:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 16:40:12,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:12,497 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2018-12-03 16:40:12,497 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:12,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash -909553915, now seen corresponding path program 79 times [2018-12-03 16:40:12,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:12,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:12,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:12,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:12,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:15,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:15,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:15,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:15,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:15,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:15,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:15,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:15,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:15,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:17,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:17,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 83 [2018-12-03 16:40:17,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:17,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:40:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:40:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:40:17,232 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 84 states. [2018-12-03 16:40:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:20,464 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 16:40:20,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:40:20,464 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 125 [2018-12-03 16:40:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:20,465 INFO L225 Difference]: With dead ends: 212 [2018-12-03 16:40:20,465 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:40:20,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 168 SyntacticMatches, 81 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5660 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:40:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:40:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 16:40:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 16:40:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 16:40:20,508 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-12-03 16:40:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:20,508 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 16:40:20,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:40:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 16:40:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:40:20,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:20,509 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2018-12-03 16:40:20,509 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash 909901614, now seen corresponding path program 80 times [2018-12-03 16:40:20,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:20,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:21,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:21,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:21,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:21,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:21,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:21,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:21,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:21,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:40:21,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:21,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:21,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 46 [2018-12-03 16:40:22,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:22,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:40:22,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:40:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:40:22,867 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 47 states. [2018-12-03 16:40:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:23,857 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 16:40:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:40:23,857 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 126 [2018-12-03 16:40:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:23,858 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:40:23,858 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:40:23,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 208 SyntacticMatches, 82 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:40:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:40:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-03 16:40:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 16:40:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 16:40:23,898 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 16:40:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:23,898 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 16:40:23,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:40:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 16:40:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:40:23,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:23,899 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2018-12-03 16:40:23,899 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:23,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:23,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1757944118, now seen corresponding path program 81 times [2018-12-03 16:40:23,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:23,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:23,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:26,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:26,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:26,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:26,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:26,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:26,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:26,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:26,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:26,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:26,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:28,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:28,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 85 [2018-12-03 16:40:28,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:28,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:40:28,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:40:28,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:40:28,314 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 86 states. [2018-12-03 16:40:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:31,963 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-12-03 16:40:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:40:31,964 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 128 [2018-12-03 16:40:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:31,964 INFO L225 Difference]: With dead ends: 217 [2018-12-03 16:40:31,965 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:40:31,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 172 SyntacticMatches, 83 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5945 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:40:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:40:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 16:40:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:40:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 16:40:32,010 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 16:40:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:32,010 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 16:40:32,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:40:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 16:40:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 16:40:32,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:32,011 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2018-12-03 16:40:32,011 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:32,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash -845555199, now seen corresponding path program 82 times [2018-12-03 16:40:32,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:32,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:32,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:32,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:32,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:32,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:32,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:32,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:32,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:32,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:32,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:33,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:34,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:34,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 47 [2018-12-03 16:40:34,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:34,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:40:34,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:40:34,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:40:34,407 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 48 states. [2018-12-03 16:40:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:35,670 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-12-03 16:40:35,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:40:35,671 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-12-03 16:40:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:35,672 INFO L225 Difference]: With dead ends: 138 [2018-12-03 16:40:35,672 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:40:35,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 213 SyntacticMatches, 84 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 16:40:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:40:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-12-03 16:40:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:40:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 16:40:35,721 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2018-12-03 16:40:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:35,722 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 16:40:35,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:40:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 16:40:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:40:35,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:35,723 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2018-12-03 16:40:35,723 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:35,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -829794083, now seen corresponding path program 83 times [2018-12-03 16:40:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:35,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:37,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:37,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:37,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:37,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:37,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:37,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:37,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:38,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:40:38,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:38,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:38,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:40,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:40,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 87 [2018-12-03 16:40:40,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:40,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:40:40,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:40:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:40:40,047 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 88 states. [2018-12-03 16:40:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:42,854 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 16:40:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:40:42,855 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 131 [2018-12-03 16:40:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:42,855 INFO L225 Difference]: With dead ends: 222 [2018-12-03 16:40:42,855 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:40:42,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 176 SyntacticMatches, 85 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6237 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:40:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:40:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 16:40:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 16:40:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 16:40:42,895 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2018-12-03 16:40:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:42,895 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 16:40:42,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:40:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 16:40:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:40:42,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:42,896 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2018-12-03 16:40:42,896 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:42,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:42,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1595442758, now seen corresponding path program 84 times [2018-12-03 16:40:42,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:42,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:42,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:42,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:43,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:43,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:43,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:43,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:43,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:43,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:43,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:43,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:43,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:43,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:43,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:43,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:45,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:45,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 48 [2018-12-03 16:40:45,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:45,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:40:45,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:40:45,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:40:45,365 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 49 states. [2018-12-03 16:40:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:46,593 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 16:40:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:40:46,593 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 132 [2018-12-03 16:40:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:46,594 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:40:46,594 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:40:46,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 218 SyntacticMatches, 86 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 16:40:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:40:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-03 16:40:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:40:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 16:40:46,635 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 16:40:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:46,636 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 16:40:46,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:40:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 16:40:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:40:46,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:46,637 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2018-12-03 16:40:46,637 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:46,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash -82901022, now seen corresponding path program 85 times [2018-12-03 16:40:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:46,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:46,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:48,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:48,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:48,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:48,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:48,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:48,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:48,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:48,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:48,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 89 [2018-12-03 16:40:51,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:51,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:40:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:40:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:40:51,253 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 90 states. [2018-12-03 16:40:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:54,053 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 16:40:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:40:54,053 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 134 [2018-12-03 16:40:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:54,054 INFO L225 Difference]: With dead ends: 227 [2018-12-03 16:40:54,054 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:40:54,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 180 SyntacticMatches, 87 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6536 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:40:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:40:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 16:40:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:40:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 16:40:54,094 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 16:40:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:54,095 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 16:40:54,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:40:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 16:40:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:40:54,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:54,095 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2018-12-03 16:40:54,095 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:54,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:54,096 INFO L82 PathProgramCache]: Analyzing trace with hash 207975897, now seen corresponding path program 86 times [2018-12-03 16:40:54,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:54,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:54,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:54,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:54,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:55,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:55,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:55,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:55,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:55,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:55,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:55,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:55,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:55,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:40:55,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:55,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:55,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 49 [2018-12-03 16:40:57,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:57,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:40:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:40:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:40:57,029 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 50 states. [2018-12-03 16:40:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:58,092 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-12-03 16:40:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:40:58,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 135 [2018-12-03 16:40:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:58,094 INFO L225 Difference]: With dead ends: 144 [2018-12-03 16:40:58,094 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 16:40:58,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 223 SyntacticMatches, 88 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3339, Invalid=5591, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:40:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 16:40:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-12-03 16:40:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:40:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 16:40:58,144 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2018-12-03 16:40:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:58,144 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 16:40:58,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:40:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 16:40:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:40:58,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:58,145 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2018-12-03 16:40:58,146 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:58,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1998692683, now seen corresponding path program 87 times [2018-12-03 16:40:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:58,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:58,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:00,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:00,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:00,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:00,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:00,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:00,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:00,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:00,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:00,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:00,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:00,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:00,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:03,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:03,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 91 [2018-12-03 16:41:03,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:03,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:41:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:41:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:41:03,110 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 92 states. [2018-12-03 16:41:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:06,201 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-12-03 16:41:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:41:06,201 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 137 [2018-12-03 16:41:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:06,202 INFO L225 Difference]: With dead ends: 232 [2018-12-03 16:41:06,202 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:41:06,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 184 SyntacticMatches, 89 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6842 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:41:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:41:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 16:41:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 16:41:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 16:41:06,253 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-12-03 16:41:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:06,253 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 16:41:06,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:41:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 16:41:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:41:06,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:06,254 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2018-12-03 16:41:06,254 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:06,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:06,255 INFO L82 PathProgramCache]: Analyzing trace with hash 566565214, now seen corresponding path program 88 times [2018-12-03 16:41:06,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:06,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:06,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:06,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:06,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:07,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:07,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:07,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:07,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:07,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:07,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:07,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:07,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:07,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:08,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 50 [2018-12-03 16:41:08,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:08,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:41:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:41:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:41:08,861 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 51 states. [2018-12-03 16:41:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:09,983 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 16:41:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:41:09,984 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 138 [2018-12-03 16:41:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:09,984 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:41:09,985 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 16:41:09,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 228 SyntacticMatches, 90 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3482, Invalid=5830, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 16:41:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 16:41:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-03 16:41:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:41:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 16:41:10,034 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 16:41:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:10,035 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 16:41:10,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:41:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 16:41:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 16:41:10,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:10,036 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2018-12-03 16:41:10,036 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:10,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash -991742726, now seen corresponding path program 89 times [2018-12-03 16:41:10,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:10,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:10,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:10,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:10,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:12,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:12,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:12,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:12,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:12,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:12,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:12,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:12,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:12,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:41:12,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:12,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:12,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:15,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:15,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 93 [2018-12-03 16:41:15,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:15,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:41:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:41:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:41:15,204 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 94 states. [2018-12-03 16:41:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:18,426 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 16:41:18,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:41:18,427 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 140 [2018-12-03 16:41:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:18,427 INFO L225 Difference]: With dead ends: 237 [2018-12-03 16:41:18,427 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 16:41:18,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 188 SyntacticMatches, 91 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7155 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:41:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 16:41:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 16:41:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:41:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 16:41:18,470 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 16:41:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:18,470 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 16:41:18,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:41:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 16:41:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 16:41:18,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:18,471 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2018-12-03 16:41:18,471 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:18,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash 253169073, now seen corresponding path program 90 times [2018-12-03 16:41:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:19,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:19,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:19,679 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:19,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:19,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:19,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:19,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:19,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:19,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:19,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:19,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:19,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 51 [2018-12-03 16:41:21,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:21,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:41:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:41:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:41:21,816 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 52 states. [2018-12-03 16:41:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:22,936 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-12-03 16:41:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:41:22,937 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 141 [2018-12-03 16:41:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:22,937 INFO L225 Difference]: With dead ends: 150 [2018-12-03 16:41:22,937 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:41:22,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 233 SyntacticMatches, 92 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3628, Invalid=6074, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 16:41:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:41:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-12-03 16:41:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 16:41:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 16:41:22,987 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-12-03 16:41:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:22,988 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 16:41:22,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:41:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 16:41:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 16:41:22,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:22,988 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2018-12-03 16:41:22,988 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:22,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1517723507, now seen corresponding path program 91 times [2018-12-03 16:41:22,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:22,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:22,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:22,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:22,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:25,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:25,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:25,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:25,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:25,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:25,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:28,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:28,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 95 [2018-12-03 16:41:28,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:41:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:41:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:41:28,252 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 96 states. [2018-12-03 16:41:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:31,347 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 16:41:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:41:31,347 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 143 [2018-12-03 16:41:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:31,348 INFO L225 Difference]: With dead ends: 242 [2018-12-03 16:41:31,348 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 16:41:31,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 192 SyntacticMatches, 93 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7475 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:41:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 16:41:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 16:41:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 16:41:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 16:41:31,394 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-12-03 16:41:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:31,394 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 16:41:31,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:41:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 16:41:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:41:31,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:31,395 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2018-12-03 16:41:31,395 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:31,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1392920458, now seen corresponding path program 92 times [2018-12-03 16:41:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:31,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:32,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:32,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:32,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:32,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:32,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:32,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:32,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:32,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:32,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:41:32,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:32,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:32,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:34,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:34,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 52 [2018-12-03 16:41:34,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:34,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:41:34,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:41:34,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:41:34,662 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 53 states. [2018-12-03 16:41:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:35,853 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 16:41:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:41:35,853 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 144 [2018-12-03 16:41:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:35,854 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:41:35,854 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:41:35,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 238 SyntacticMatches, 94 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3777, Invalid=6323, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:41:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:41:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-03 16:41:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:41:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 16:41:35,902 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 16:41:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:35,903 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 16:41:35,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:41:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 16:41:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:41:35,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:35,904 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2018-12-03 16:41:35,904 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:35,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1433169426, now seen corresponding path program 93 times [2018-12-03 16:41:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:35,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:35,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:38,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:38,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:38,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:38,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:38,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:38,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:38,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:38,831 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:38,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:38,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:38,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:38,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:41,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:41,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 97 [2018-12-03 16:41:41,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:41,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:41:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:41:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:41:41,435 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 98 states. [2018-12-03 16:41:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:44,576 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 16:41:44,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:41:44,576 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 146 [2018-12-03 16:41:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:44,577 INFO L225 Difference]: With dead ends: 247 [2018-12-03 16:41:44,577 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:41:44,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 196 SyntacticMatches, 95 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7802 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:41:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:41:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 16:41:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:41:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 16:41:44,626 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 16:41:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:44,626 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 16:41:44,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:41:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 16:41:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:41:44,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:44,627 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2018-12-03 16:41:44,627 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:44,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:44,627 INFO L82 PathProgramCache]: Analyzing trace with hash -876151, now seen corresponding path program 94 times [2018-12-03 16:41:44,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:44,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:44,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:44,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:45,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:45,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:45,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:45,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:45,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:45,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:45,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:45,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:45,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:45,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:47,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:47,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 53 [2018-12-03 16:41:47,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:47,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:41:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:41:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:41:47,912 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 54 states. [2018-12-03 16:41:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:49,155 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-12-03 16:41:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:41:49,155 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 147 [2018-12-03 16:41:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:49,156 INFO L225 Difference]: With dead ends: 156 [2018-12-03 16:41:49,156 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 16:41:49,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 243 SyntacticMatches, 96 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3929, Invalid=6577, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:41:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 16:41:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-03 16:41:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:41:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 16:41:49,206 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-12-03 16:41:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:49,207 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 16:41:49,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:41:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 16:41:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 16:41:49,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:49,207 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2018-12-03 16:41:49,208 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:49,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash -842047899, now seen corresponding path program 95 times [2018-12-03 16:41:49,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:49,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:49,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:49,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:49,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:52,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:52,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:52,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:52,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:52,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:52,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:52,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:52,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:52,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:41:52,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:52,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:52,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 99 [2018-12-03 16:41:54,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:54,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:41:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:41:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:41:54,792 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 100 states. [2018-12-03 16:41:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:58,428 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 16:41:58,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:41:58,428 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 149 [2018-12-03 16:41:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:58,429 INFO L225 Difference]: With dead ends: 252 [2018-12-03 16:41:58,429 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:41:58,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 200 SyntacticMatches, 97 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8136 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:41:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:41:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:41:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:41:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 16:41:58,486 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-12-03 16:41:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:58,486 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 16:41:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:41:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 16:41:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:41:58,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:58,487 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2018-12-03 16:41:58,487 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:58,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash -454138994, now seen corresponding path program 96 times [2018-12-03 16:41:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:58,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:58,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:58,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:59,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:59,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:59,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:59,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:59,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:59,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:59,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:59,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:59,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:59,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:59,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:01,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:01,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 54 [2018-12-03 16:42:01,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:42:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:42:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:42:01,561 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 55 states. [2018-12-03 16:42:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:03,153 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 16:42:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:42:03,154 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 150 [2018-12-03 16:42:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:03,155 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:42:03,155 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 16:42:03,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 248 SyntacticMatches, 98 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4084, Invalid=6836, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 16:42:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 16:42:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-12-03 16:42:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 16:42:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 16:42:03,207 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 16:42:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:03,207 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 16:42:03,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:42:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 16:42:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:42:03,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:03,208 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2018-12-03 16:42:03,208 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:03,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1659024170, now seen corresponding path program 97 times [2018-12-03 16:42:03,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:05,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:05,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:05,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:05,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:05,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:05,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:06,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:06,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:09,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:09,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 101 [2018-12-03 16:42:09,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:09,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:42:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:42:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:42:09,093 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 102 states. [2018-12-03 16:42:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:12,094 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 16:42:12,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:42:12,094 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 152 [2018-12-03 16:42:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:12,094 INFO L225 Difference]: With dead ends: 257 [2018-12-03 16:42:12,095 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 16:42:12,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 204 SyntacticMatches, 99 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8477 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:42:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 16:42:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 16:42:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 16:42:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 16:42:12,147 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 16:42:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:12,147 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 16:42:12,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:42:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 16:42:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 16:42:12,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:12,148 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2018-12-03 16:42:12,148 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:12,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash 96219489, now seen corresponding path program 98 times [2018-12-03 16:42:12,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:12,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:12,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:13,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:13,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:13,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:13,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:13,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:13,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:13,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:42:13,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:42:13,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:42:13,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:13,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:13,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 55 [2018-12-03 16:42:15,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:15,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:42:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:42:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:42:15,737 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 56 states. [2018-12-03 16:42:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:17,048 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-12-03 16:42:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:42:17,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 153 [2018-12-03 16:42:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:17,049 INFO L225 Difference]: With dead ends: 162 [2018-12-03 16:42:17,049 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 16:42:17,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 253 SyntacticMatches, 100 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4242, Invalid=7100, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:42:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 16:42:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-12-03 16:42:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:42:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 16:42:17,104 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2018-12-03 16:42:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:17,104 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 16:42:17,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:42:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 16:42:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 16:42:17,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:17,105 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2018-12-03 16:42:17,105 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:17,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:17,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2022418371, now seen corresponding path program 99 times [2018-12-03 16:42:17,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:17,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:17,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:17,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:17,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:20,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:20,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:20,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:20,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:20,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:20,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:20,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:42:20,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:42:20,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:42:20,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:20,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:20,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:23,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:23,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 103 [2018-12-03 16:42:23,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:23,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:42:23,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:42:23,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:42:23,556 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 104 states. [2018-12-03 16:42:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:27,150 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-12-03 16:42:27,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:42:27,150 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 155 [2018-12-03 16:42:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:27,151 INFO L225 Difference]: With dead ends: 262 [2018-12-03 16:42:27,151 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 16:42:27,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 208 SyntacticMatches, 101 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8825 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 16:42:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 16:42:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 16:42:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 16:42:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 16:42:27,206 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2018-12-03 16:42:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:27,207 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 16:42:27,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:42:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 16:42:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:42:27,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:27,207 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2018-12-03 16:42:27,208 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:27,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2091181402, now seen corresponding path program 100 times [2018-12-03 16:42:27,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:27,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:27,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:27,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:27,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:28,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:28,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:28,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:28,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:28,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:28,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:28,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:28,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:28,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:28,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:30,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:30,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2018-12-03 16:42:30,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:30,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:42:30,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:42:30,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:42:30,818 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 57 states. [2018-12-03 16:42:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:32,168 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 16:42:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:42:32,168 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 156 [2018-12-03 16:42:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:32,169 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:42:32,170 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:42:32,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 258 SyntacticMatches, 102 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4403, Invalid=7369, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 16:42:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:42:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-12-03 16:42:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 16:42:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 16:42:32,229 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 16:42:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:32,229 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 16:42:32,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:42:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 16:42:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:42:32,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:32,230 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2018-12-03 16:42:32,230 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:32,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:32,230 INFO L82 PathProgramCache]: Analyzing trace with hash 419300418, now seen corresponding path program 101 times [2018-12-03 16:42:32,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:32,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:32,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:35,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:35,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:35,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:35,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:35,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:35,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:35,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:42:35,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:42:35,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:42:35,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:35,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:35,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 105 [2018-12-03 16:42:38,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:38,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:42:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:42:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:42:38,988 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 106 states. [2018-12-03 16:42:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:42,799 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-12-03 16:42:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:42:42,799 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 158 [2018-12-03 16:42:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:42,800 INFO L225 Difference]: With dead ends: 267 [2018-12-03 16:42:42,800 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 16:42:42,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 212 SyntacticMatches, 103 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:42:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 16:42:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 16:42:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:42:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 16:42:42,873 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 16:42:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:42,873 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 16:42:42,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:42:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 16:42:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:42:42,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:42,874 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2018-12-03 16:42:42,874 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:42,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 599244089, now seen corresponding path program 102 times [2018-12-03 16:42:42,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:42,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:42,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:44,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:44,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:44,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:44,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:44,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:44,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:44,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:42:44,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:42:44,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:42:44,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:44,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:44,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:46,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:46,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 57 [2018-12-03 16:42:46,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:46,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:42:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:42:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1545, Invalid=1761, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:42:46,605 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 58 states. [2018-12-03 16:42:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:48,036 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-12-03 16:42:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:42:48,036 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 159 [2018-12-03 16:42:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:48,037 INFO L225 Difference]: With dead ends: 168 [2018-12-03 16:42:48,037 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 16:42:48,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 263 SyntacticMatches, 104 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4567, Invalid=7643, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 16:42:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 16:42:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-12-03 16:42:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:42:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 16:42:48,102 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2018-12-03 16:42:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:48,102 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 16:42:48,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:42:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 16:42:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 16:42:48,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:48,103 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2018-12-03 16:42:48,103 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:48,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 347885077, now seen corresponding path program 103 times [2018-12-03 16:42:48,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:48,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:48,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:51,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:51,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:51,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:51,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 16:42:51,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:51,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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:51,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:51,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:51,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:51,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:54,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:54,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 107 [2018-12-03 16:42:54,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:54,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:42:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:42:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:42:54,960 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 108 states. [2018-12-03 16:42:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:59,175 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-12-03 16:42:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:42:59,175 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 161 [2018-12-03 16:42:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:59,176 INFO L225 Difference]: With dead ends: 272 [2018-12-03 16:42:59,176 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:42:59,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 216 SyntacticMatches, 105 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9542 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:42:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:42:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 16:42:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 16:42:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 16:42:59,238 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-12-03 16:42:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:59,238 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 16:42:59,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:42:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 16:42:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:42:59,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:59,239 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2018-12-03 16:42:59,239 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:59,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash 930602430, now seen corresponding path program 104 times [2018-12-03 16:42:59,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:59,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:59,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:00,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:00,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:00,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:00,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:00,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:00,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:00,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:43:00,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:43:00,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:43:00,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:00,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:00,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:02,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:02,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 58 [2018-12-03 16:43:02,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:02,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:43:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:43:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:43:02,913 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 59 states. [2018-12-03 16:43:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:04,651 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-12-03 16:43:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:43:04,652 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 162 [2018-12-03 16:43:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:04,653 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:43:04,653 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 16:43:04,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 268 SyntacticMatches, 106 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4734, Invalid=7922, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:43:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 16:43:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-12-03 16:43:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:43:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 16:43:04,714 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 16:43:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:04,714 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 16:43:04,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:43:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 16:43:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 16:43:04,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:04,715 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2018-12-03 16:43:04,715 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:04,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash 955670874, now seen corresponding path program 105 times [2018-12-03 16:43:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:04,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:04,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:04,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:04,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:07,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:07,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:07,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:07,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:07,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:07,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:07,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:43:07,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:43:08,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:43:08,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:08,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:08,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:11,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:11,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 109 [2018-12-03 16:43:11,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:11,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:43:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:43:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:43:11,606 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 110 states. [2018-12-03 16:43:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:15,941 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-12-03 16:43:15,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:43:15,941 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 164 [2018-12-03 16:43:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:15,942 INFO L225 Difference]: With dead ends: 277 [2018-12-03 16:43:15,942 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 16:43:15,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 220 SyntacticMatches, 107 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9911 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:43:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 16:43:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 16:43:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 16:43:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-12-03 16:43:16,009 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-12-03 16:43:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:16,010 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-12-03 16:43:16,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:43:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-12-03 16:43:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 16:43:16,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:16,011 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2018-12-03 16:43:16,011 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:16,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash 430523665, now seen corresponding path program 106 times [2018-12-03 16:43:16,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:17,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:17,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:17,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:17,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:17,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:17,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:17,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:17,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:17,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:17,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:19,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:19,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 59 [2018-12-03 16:43:19,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:19,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:43:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:43:19,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1658, Invalid=1882, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:43:19,913 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 60 states. [2018-12-03 16:43:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:21,395 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-12-03 16:43:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 16:43:21,396 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 165 [2018-12-03 16:43:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:21,396 INFO L225 Difference]: With dead ends: 174 [2018-12-03 16:43:21,397 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 16:43:21,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 273 SyntacticMatches, 108 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4904, Invalid=8206, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 16:43:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 16:43:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-12-03 16:43:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 16:43:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-12-03 16:43:21,463 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-12-03 16:43:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:21,463 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-12-03 16:43:21,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:43:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-12-03 16:43:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 16:43:21,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:21,463 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2018-12-03 16:43:21,464 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:21,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1416314861, now seen corresponding path program 107 times [2018-12-03 16:43:21,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:21,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:21,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:25,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:25,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:25,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:25,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:43:25,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:43:25,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:43:25,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:25,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:25,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:28,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 111 [2018-12-03 16:43:28,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:28,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:43:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:43:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:43:28,615 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 112 states. [2018-12-03 16:43:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:33,050 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-12-03 16:43:33,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:43:33,051 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 167 [2018-12-03 16:43:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:33,051 INFO L225 Difference]: With dead ends: 282 [2018-12-03 16:43:33,051 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 16:43:33,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 224 SyntacticMatches, 109 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10287 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 16:43:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 16:43:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 16:43:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 16:43:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 16:43:33,124 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 167 [2018-12-03 16:43:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:33,125 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 16:43:33,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:43:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 16:43:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 16:43:33,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:33,126 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2018-12-03 16:43:33,126 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:33,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -973296426, now seen corresponding path program 108 times [2018-12-03 16:43:33,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:33,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:33,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:34,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:34,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:34,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:34,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:34,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:34,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:34,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:43:34,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:43:34,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:43:34,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:34,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:34,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:37,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:37,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 60 [2018-12-03 16:43:37,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:37,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:43:37,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:43:37,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:43:37,069 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 61 states. [2018-12-03 16:43:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:38,569 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-12-03 16:43:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 16:43:38,569 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 168 [2018-12-03 16:43:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:38,570 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:43:38,570 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 16:43:38,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 278 SyntacticMatches, 110 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5077, Invalid=8495, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 16:43:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 16:43:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-03 16:43:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 16:43:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 16:43:38,636 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 16:43:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:38,636 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 16:43:38,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:43:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 16:43:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 16:43:38,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:38,637 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1] [2018-12-03 16:43:38,637 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:38,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 964938354, now seen corresponding path program 109 times [2018-12-03 16:43:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:38,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:38,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:42,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:42,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:42,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:42,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:42,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:42,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:42,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:42,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:42,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:46,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:46,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 113 [2018-12-03 16:43:46,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:46,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 16:43:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 16:43:46,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:43:46,210 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 114 states. [2018-12-03 16:43:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:50,796 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-12-03 16:43:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 16:43:50,796 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 170 [2018-12-03 16:43:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:50,797 INFO L225 Difference]: With dead ends: 287 [2018-12-03 16:43:50,797 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 16:43:50,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 228 SyntacticMatches, 111 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10670 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:43:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 16:43:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 16:43:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 16:43:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-12-03 16:43:50,862 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-12-03 16:43:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:50,862 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-12-03 16:43:50,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 16:43:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-12-03 16:43:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 16:43:50,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:50,863 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2018-12-03 16:43:50,863 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:50,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1138018537, now seen corresponding path program 110 times [2018-12-03 16:43:50,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:50,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:52,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:52,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:52,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:52,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:52,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:52,241 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:52,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:43:52,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:43:52,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:43:52,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:52,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:52,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:54,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 61 [2018-12-03 16:43:54,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:54,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:43:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:43:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1775, Invalid=2007, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:43:54,939 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 62 states. [2018-12-03 16:43:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:56,599 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-12-03 16:43:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 16:43:56,600 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 171 [2018-12-03 16:43:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:56,600 INFO L225 Difference]: With dead ends: 180 [2018-12-03 16:43:56,600 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 16:43:56,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 283 SyntacticMatches, 112 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5253, Invalid=8789, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:43:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 16:43:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-12-03 16:43:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 16:43:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-12-03 16:43:56,669 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2018-12-03 16:43:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:56,669 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-12-03 16:43:56,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:43:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-12-03 16:43:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 16:43:56,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:56,670 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1] [2018-12-03 16:43:56,670 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:56,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1580913211, now seen corresponding path program 111 times [2018-12-03 16:43:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:56,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:56,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:00,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:00,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:00,540 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:00,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:00,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:00,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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:00,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:00,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:00,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:00,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:00,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:00,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:04,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:04,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 115 [2018-12-03 16:44:04,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:04,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 16:44:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 16:44:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:44:04,176 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 116 states. [2018-12-03 16:44:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:07,945 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 16:44:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 16:44:07,945 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 173 [2018-12-03 16:44:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:07,946 INFO L225 Difference]: With dead ends: 292 [2018-12-03 16:44:07,946 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 16:44:07,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 232 SyntacticMatches, 113 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11060 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 16:44:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 16:44:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 16:44:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:44:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 16:44:08,014 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-12-03 16:44:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:08,014 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 16:44:08,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 16:44:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 16:44:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:44:08,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:08,015 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2018-12-03 16:44:08,015 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:08,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:08,015 INFO L82 PathProgramCache]: Analyzing trace with hash 690063342, now seen corresponding path program 112 times [2018-12-03 16:44:08,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:08,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:08,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:09,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:09,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:09,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:09,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:09,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:09,433 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:09,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:09,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:09,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:12,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:12,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 62 [2018-12-03 16:44:12,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:12,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:44:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:44:12,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:44:12,334 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 63 states. [2018-12-03 16:44:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:13,934 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-12-03 16:44:13,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 16:44:13,935 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 174 [2018-12-03 16:44:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:13,936 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:44:13,936 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:44:13,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 288 SyntacticMatches, 114 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5432, Invalid=9088, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 16:44:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:44:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-12-03 16:44:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:44:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 16:44:14,006 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 16:44:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:14,006 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 16:44:14,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:44:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 16:44:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 16:44:14,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:14,007 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1] [2018-12-03 16:44:14,007 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:14,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1725841290, now seen corresponding path program 113 times [2018-12-03 16:44:14,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:14,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:18,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:18,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:18,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:18,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:18,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:18,047 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:18,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:18,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 16:44:18,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:18,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:18,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:22,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:22,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 117 [2018-12-03 16:44:22,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 16:44:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 16:44:22,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:44:22,274 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 118 states. [2018-12-03 16:44:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:27,198 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-12-03 16:44:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 16:44:27,198 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 176 [2018-12-03 16:44:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:27,199 INFO L225 Difference]: With dead ends: 297 [2018-12-03 16:44:27,199 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 16:44:27,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 236 SyntacticMatches, 115 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11457 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:44:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 16:44:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 16:44:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 16:44:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-12-03 16:44:27,268 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-12-03 16:44:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:27,269 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-12-03 16:44:27,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 16:44:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-12-03 16:44:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 16:44:27,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:27,270 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2018-12-03 16:44:27,270 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:27,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2063485121, now seen corresponding path program 114 times [2018-12-03 16:44:27,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:27,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:27,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:28,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:28,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:28,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:28,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:28,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:28,722 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:28,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:28,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:28,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:28,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:28,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:28,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:31,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:31,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 63 [2018-12-03 16:44:31,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:31,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:44:31,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:44:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:44:31,717 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 64 states. [2018-12-03 16:44:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:33,320 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-12-03 16:44:33,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 16:44:33,321 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 177 [2018-12-03 16:44:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:33,322 INFO L225 Difference]: With dead ends: 186 [2018-12-03 16:44:33,322 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 16:44:33,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 293 SyntacticMatches, 116 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5614, Invalid=9392, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 16:44:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 16:44:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-12-03 16:44:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 16:44:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-12-03 16:44:33,394 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2018-12-03 16:44:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:33,394 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-12-03 16:44:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:44:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-12-03 16:44:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 16:44:33,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:33,395 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1] [2018-12-03 16:44:33,395 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:33,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1265756259, now seen corresponding path program 115 times [2018-12-03 16:44:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:33,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:33,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:37,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:37,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:37,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:37,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:37,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:37,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:37,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:37,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:37,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:37,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:41,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:41,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 119 [2018-12-03 16:44:41,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:41,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 16:44:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 16:44:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:44:41,570 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 120 states. [2018-12-03 16:44:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:46,747 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-12-03 16:44:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-12-03 16:44:46,747 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 179 [2018-12-03 16:44:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:46,748 INFO L225 Difference]: With dead ends: 302 [2018-12-03 16:44:46,748 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:44:46,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 240 SyntacticMatches, 117 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11861 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 16:44:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:44:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 16:44:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 16:44:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 16:44:46,819 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 179 [2018-12-03 16:44:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:46,819 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 16:44:46,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 16:44:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 16:44:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 16:44:46,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:46,820 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2018-12-03 16:44:46,820 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:46,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1331794170, now seen corresponding path program 116 times [2018-12-03 16:44:46,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:46,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:46,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:46,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:46,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:48,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:48,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:48,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:48,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:48,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:48,286 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:48,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:48,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-12-03 16:44:48,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:48,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:48,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:51,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:51,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 64 [2018-12-03 16:44:51,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:51,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:44:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:44:51,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:44:51,266 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 65 states. [2018-12-03 16:44:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:53,054 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-12-03 16:44:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 16:44:53,054 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 180 [2018-12-03 16:44:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:53,055 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:44:53,055 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 16:44:53,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 298 SyntacticMatches, 118 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5799, Invalid=9701, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:44:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 16:44:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-12-03 16:44:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 16:44:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-03 16:44:53,129 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-03 16:44:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:53,130 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-03 16:44:53,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:44:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-03 16:44:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 16:44:53,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:53,130 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1] [2018-12-03 16:44:53,131 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:53,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:53,131 INFO L82 PathProgramCache]: Analyzing trace with hash 45990050, now seen corresponding path program 117 times [2018-12-03 16:44:53,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:53,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:53,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:57,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:57,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:57,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:57,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:57,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:57,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:57,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:57,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:57,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:01,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:01,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 121 [2018-12-03 16:45:01,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:01,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 16:45:01,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 16:45:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:45:01,371 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 122 states. [2018-12-03 16:45:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:06,715 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-12-03 16:45:06,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 16:45:06,715 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 182 [2018-12-03 16:45:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:06,716 INFO L225 Difference]: With dead ends: 307 [2018-12-03 16:45:06,716 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 16:45:06,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 244 SyntacticMatches, 119 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12272 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:45:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 16:45:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 16:45:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 16:45:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-12-03 16:45:06,790 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 182 [2018-12-03 16:45:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:06,790 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-12-03 16:45:06,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 16:45:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-12-03 16:45:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 16:45:06,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:06,791 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1, 1, 1] [2018-12-03 16:45:06,791 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:06,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash -194394983, now seen corresponding path program 118 times [2018-12-03 16:45:06,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:06,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:06,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:08,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:08,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:08,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:08,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:08,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:08,458 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:45:08,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:08,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:45:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:08,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:08,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 65 [2018-12-03 16:45:11,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:11,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:45:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:45:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:45:11,308 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 66 states. [2018-12-03 16:45:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:13,250 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-12-03 16:45:13,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-03 16:45:13,251 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 183 [2018-12-03 16:45:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:13,251 INFO L225 Difference]: With dead ends: 192 [2018-12-03 16:45:13,252 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 16:45:13,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 303 SyntacticMatches, 120 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7502 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5987, Invalid=10015, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 16:45:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 16:45:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-12-03 16:45:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 16:45:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-12-03 16:45:13,329 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2018-12-03 16:45:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:13,329 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-12-03 16:45:13,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:45:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-12-03 16:45:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 16:45:13,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:13,330 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1] [2018-12-03 16:45:13,330 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:13,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2130051723, now seen corresponding path program 119 times [2018-12-03 16:45:13,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:13,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:13,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:17,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:17,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:17,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:17,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:17,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:17,603 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:45:17,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:45:17,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:45:17,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 16:45:17,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:17,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:17,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:21,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:21,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 123 [2018-12-03 16:45:21,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:21,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 16:45:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 16:45:21,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:45:21,888 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 124 states. [2018-12-03 16:45:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:26,840 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2018-12-03 16:45:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-03 16:45:26,840 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 185 [2018-12-03 16:45:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:26,841 INFO L225 Difference]: With dead ends: 312 [2018-12-03 16:45:26,841 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 16:45:26,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 248 SyntacticMatches, 121 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12690 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 16:45:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 16:45:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 16:45:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 16:45:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 16:45:26,927 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 185 [2018-12-03 16:45:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:26,927 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 16:45:26,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 16:45:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 16:45:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 16:45:26,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:26,928 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1, 1, 1] [2018-12-03 16:45:26,928 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:26,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:26,928 INFO L82 PathProgramCache]: Analyzing trace with hash 564879902, now seen corresponding path program 120 times [2018-12-03 16:45:26,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:26,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:26,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:28,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:28,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:28,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:28,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:28,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:28,766 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:45:28,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:28,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:28,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:28,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:28,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:29,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:31,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:31,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 66 [2018-12-03 16:45:31,725 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:31,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:45:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:45:31,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:45:31,726 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 67 states. [2018-12-03 16:45:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:33,794 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-12-03 16:45:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 16:45:33,794 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 186 [2018-12-03 16:45:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:33,795 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:45:33,795 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 16:45:33,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 308 SyntacticMatches, 122 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7749 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6178, Invalid=10334, Unknown=0, NotChecked=0, Total=16512 [2018-12-03 16:45:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 16:45:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-12-03 16:45:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 16:45:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 16:45:33,875 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 16:45:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:33,875 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 16:45:33,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:45:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 16:45:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 16:45:33,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:33,876 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1] [2018-12-03 16:45:33,876 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:33,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1683639738, now seen corresponding path program 121 times [2018-12-03 16:45:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:33,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:33,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:38,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:38,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:38,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:38,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:38,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:38,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:45:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:38,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:45:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:38,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:38,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:42,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:42,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125, 125] total 125 [2018-12-03 16:45:42,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:42,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 16:45:42,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 16:45:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:45:42,773 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 126 states. [2018-12-03 16:45:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:48,372 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-12-03 16:45:48,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-03 16:45:48,372 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 188 [2018-12-03 16:45:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:48,373 INFO L225 Difference]: With dead ends: 317 [2018-12-03 16:45:48,373 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 16:45:48,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 252 SyntacticMatches, 123 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13115 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:45:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 16:45:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 16:45:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 16:45:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-12-03 16:45:48,453 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 188 [2018-12-03 16:45:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:48,453 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-12-03 16:45:48,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 16:45:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-12-03 16:45:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 16:45:48,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:48,453 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1, 1, 1] [2018-12-03 16:45:48,454 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:48,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 568015985, now seen corresponding path program 122 times [2018-12-03 16:45:48,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:48,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:48,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:48,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:50,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:50,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:50,162 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:50,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:50,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:50,162 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:45:50,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:45:50,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:45:50,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 16:45:50,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:50,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:50,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 67 [2018-12-03 16:45:53,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:53,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:45:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:45:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2150, Invalid=2406, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:45:53,672 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 68 states. [2018-12-03 16:45:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:55,526 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2018-12-03 16:45:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-03 16:45:55,530 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 189 [2018-12-03 16:45:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:55,531 INFO L225 Difference]: With dead ends: 198 [2018-12-03 16:45:55,531 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 16:45:55,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 313 SyntacticMatches, 124 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8000 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6372, Invalid=10658, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:45:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 16:45:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2018-12-03 16:45:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 16:45:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-12-03 16:45:55,615 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2018-12-03 16:45:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:55,615 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-12-03 16:45:55,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:45:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-12-03 16:45:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 16:45:55,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:55,616 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1] [2018-12-03 16:45:55,616 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:55,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 402448205, now seen corresponding path program 123 times [2018-12-03 16:45:55,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:55,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:55,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:55,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:00,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:00,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:00,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:00,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:00,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:00,191 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:46:00,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:46:00,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:46:00,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:00,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:00,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:04,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 127 [2018-12-03 16:46:04,946 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 16:46:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 16:46:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:46:04,947 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 128 states. [2018-12-03 16:46:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:10,846 INFO L93 Difference]: Finished difference Result 322 states and 324 transitions. [2018-12-03 16:46:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 16:46:10,846 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 191 [2018-12-03 16:46:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:10,846 INFO L225 Difference]: With dead ends: 322 [2018-12-03 16:46:10,847 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 16:46:10,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 256 SyntacticMatches, 125 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13547 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 16:46:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 16:46:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 16:46:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 16:46:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 16:46:10,933 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 191 [2018-12-03 16:46:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:10,934 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 16:46:10,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 16:46:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 16:46:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 16:46:10,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:10,935 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1, 1, 1] [2018-12-03 16:46:10,935 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:10,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash -687840970, now seen corresponding path program 124 times [2018-12-03 16:46:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:10,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:10,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:12,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:12,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:12,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:12,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 16:46:12,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:12,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:12,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:12,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:12,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:12,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:16,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 68 [2018-12-03 16:46:16,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:16,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:46:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:46:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:46:16,046 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 69 states. [2018-12-03 16:46:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:17,979 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-12-03 16:46:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 16:46:17,979 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 192 [2018-12-03 16:46:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:17,980 INFO L225 Difference]: With dead ends: 201 [2018-12-03 16:46:17,980 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 16:46:17,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 318 SyntacticMatches, 126 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8255 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6569, Invalid=10987, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 16:46:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 16:46:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-12-03 16:46:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 16:46:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 16:46:18,090 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 16:46:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:18,091 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 16:46:18,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:46:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 16:46:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 16:46:18,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:18,091 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1] [2018-12-03 16:46:18,092 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:18,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 409724626, now seen corresponding path program 125 times [2018-12-03 16:46:18,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:18,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:18,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:18,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:22,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:22,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:22,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:22,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:22,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:22,753 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:22,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:22,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:23,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 16:46:23,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:23,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:23,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:27,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:27,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 129 [2018-12-03 16:46:27,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:27,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 16:46:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 16:46:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:46:27,797 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 130 states. [2018-12-03 16:46:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:33,955 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-12-03 16:46:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 16:46:33,955 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 194 [2018-12-03 16:46:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:33,956 INFO L225 Difference]: With dead ends: 327 [2018-12-03 16:46:33,956 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 16:46:33,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 260 SyntacticMatches, 127 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13986 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:46:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 16:46:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 16:46:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:46:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-12-03 16:46:34,040 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 194 [2018-12-03 16:46:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:34,040 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-12-03 16:46:34,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 16:46:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-12-03 16:46:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 16:46:34,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:34,041 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1, 1, 1] [2018-12-03 16:46:34,041 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:34,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1852395447, now seen corresponding path program 126 times [2018-12-03 16:46:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:34,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:34,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:34,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:35,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:35,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:35,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:35,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:35,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:35,780 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:46:35,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:46:35,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:46:35,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:35,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:36,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2016 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:39,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:39,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 72 [2018-12-03 16:46:39,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:39,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:46:39,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:46:39,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2363, Invalid=2893, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:46:39,344 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 71 states. [2018-12-03 16:46:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:41,569 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-12-03 16:46:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 16:46:41,569 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 195 [2018-12-03 16:46:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:41,570 INFO L225 Difference]: With dead ends: 204 [2018-12-03 16:46:41,570 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 16:46:41,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 321 SyntacticMatches, 127 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8779 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6779, Invalid=11853, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:46:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 16:46:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-12-03 16:46:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 16:46:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-12-03 16:46:41,662 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2018-12-03 16:46:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:41,662 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-12-03 16:46:41,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:46:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-12-03 16:46:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 16:46:41,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:41,663 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1] [2018-12-03 16:46:41,664 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:41,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2035630811, now seen corresponding path program 127 times [2018-12-03 16:46:41,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:41,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:41,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:46,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:46,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:46,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:46,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:46,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:46,539 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:46,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:46,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:46,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:51,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:51,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 131 [2018-12-03 16:46:51,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:51,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 16:46:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 16:46:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:46:51,381 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 132 states. [2018-12-03 16:46:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:57,507 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2018-12-03 16:46:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 16:46:57,507 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 197 [2018-12-03 16:46:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:57,508 INFO L225 Difference]: With dead ends: 332 [2018-12-03 16:46:57,508 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 16:46:57,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 264 SyntacticMatches, 129 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14432 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=8841, Invalid=29771, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 16:46:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 16:46:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 16:46:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 16:46:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-03 16:46:57,595 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 197 [2018-12-03 16:46:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:57,595 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-03 16:46:57,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 16:46:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-03 16:46:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 16:46:57,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:57,596 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1, 1, 1] [2018-12-03 16:46:57,596 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:57,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash -522884018, now seen corresponding path program 128 times [2018-12-03 16:46:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:57,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2145 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:59,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:59,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:59,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:59,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:59,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:59,698 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:59,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:47:00,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2018-12-03 16:47:00,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:00,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2145 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:00,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2080 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:03,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 73 [2018-12-03 16:47:03,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:03,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:47:03,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:47:03,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2432, Invalid=2970, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:47:03,367 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 72 states. [2018-12-03 16:47:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:05,588 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-12-03 16:47:05,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-03 16:47:05,588 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 198 [2018-12-03 16:47:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:05,589 INFO L225 Difference]: With dead ends: 207 [2018-12-03 16:47:05,589 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 16:47:05,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 326 SyntacticMatches, 129 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9046 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6982, Invalid=12200, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 16:47:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 16:47:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-12-03 16:47:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 16:47:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-03 16:47:05,673 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-03 16:47:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:05,674 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-03 16:47:05,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:47:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-03 16:47:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 16:47:05,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:05,675 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1] [2018-12-03 16:47:05,675 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:05,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:05,675 INFO L82 PathProgramCache]: Analyzing trace with hash 19565546, now seen corresponding path program 129 times [2018-12-03 16:47:05,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:05,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:05,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:05,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:05,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:10,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:10,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:10,526 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:10,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:10,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:10,526 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:47:10,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:47:10,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:47:10,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:47:10,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:10,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:10,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:15,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:15,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133, 133] total 133 [2018-12-03 16:47:15,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:15,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 16:47:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 16:47:15,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:47:15,634 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 134 states. [2018-12-03 16:47:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:19,593 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-12-03 16:47:19,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 16:47:19,594 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 200 [2018-12-03 16:47:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:19,594 INFO L225 Difference]: With dead ends: 337 [2018-12-03 16:47:19,594 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 16:47:19,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 268 SyntacticMatches, 131 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14885 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=9109, Invalid=30691, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:47:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 16:47:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-12-03 16:47:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 16:47:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-12-03 16:47:19,686 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 200 [2018-12-03 16:47:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-12-03 16:47:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 16:47:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-12-03 16:47:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 16:47:19,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:19,687 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1, 1, 1] [2018-12-03 16:47:19,687 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:19,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash -832561119, now seen corresponding path program 130 times [2018-12-03 16:47:19,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:19,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:19,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2211 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:21,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:21,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:21,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:21,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:21,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:21,730 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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:47:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:21,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:47:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:21,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2211 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:22,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2145 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:25,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 74 [2018-12-03 16:47:25,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:25,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:47:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:47:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2502, Invalid=3048, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:47:25,519 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 73 states. [2018-12-03 16:47:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:27,586 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2018-12-03 16:47:27,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-12-03 16:47:27,586 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 201 [2018-12-03 16:47:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:27,586 INFO L225 Difference]: With dead ends: 210 [2018-12-03 16:47:27,586 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 16:47:27,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 331 SyntacticMatches, 131 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9317 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7188, Invalid=12552, Unknown=0, NotChecked=0, Total=19740 [2018-12-03 16:47:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 16:47:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-12-03 16:47:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 16:47:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-12-03 16:47:27,670 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2018-12-03 16:47:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:27,670 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-12-03 16:47:27,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:47:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-12-03 16:47:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 16:47:27,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:27,671 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1] [2018-12-03 16:47:27,671 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:27,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1227385091, now seen corresponding path program 131 times [2018-12-03 16:47:27,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:27,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:32,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:32,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:32,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:32,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:32,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:32,777 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:47:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:47:32,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:47:33,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 16:47:33,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:33,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:33,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:38,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:38,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135, 135] total 135 [2018-12-03 16:47:38,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:38,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 16:47:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 16:47:38,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:47:38,370 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 136 states. [2018-12-03 16:47:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:44,900 INFO L93 Difference]: Finished difference Result 342 states and 344 transitions. [2018-12-03 16:47:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-12-03 16:47:44,900 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 203 [2018-12-03 16:47:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:44,901 INFO L225 Difference]: With dead ends: 342 [2018-12-03 16:47:44,901 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 16:47:44,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 272 SyntacticMatches, 133 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15345 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=9381, Invalid=31625, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 16:47:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 16:47:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 16:47:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 16:47:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-03 16:47:44,994 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 203 [2018-12-03 16:47:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:44,994 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-03 16:47:44,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 16:47:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-03 16:47:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 16:47:44,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:44,994 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1, 1, 1] [2018-12-03 16:47:44,995 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:44,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash 618824550, now seen corresponding path program 132 times [2018-12-03 16:47:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:44,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:44,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2278 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:47,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:47,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:47,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:47,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:47,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:47,220 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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:47:47,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:47:47,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:47:47,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:47:47,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:47,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2278 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:48,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2211 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:52,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:52,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 75 [2018-12-03 16:47:52,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:52,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:47:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:47:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2573, Invalid=3127, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:47:52,026 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 74 states. [2018-12-03 16:47:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:54,152 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-12-03 16:47:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-03 16:47:54,152 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 204 [2018-12-03 16:47:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:54,153 INFO L225 Difference]: With dead ends: 213 [2018-12-03 16:47:54,153 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 16:47:54,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 336 SyntacticMatches, 133 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9592 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7397, Invalid=12909, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:47:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 16:47:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-12-03 16:47:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 16:47:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-03 16:47:54,248 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-03 16:47:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:54,249 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-03 16:47:54,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:47:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-03 16:47:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 16:47:54,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:54,249 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1] [2018-12-03 16:47:54,250 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:54,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1984838914, now seen corresponding path program 133 times [2018-12-03 16:47:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:54,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:54,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:54,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:54,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:59,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:59,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:59,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:59,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:59,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:59,432 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:47:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:59,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:47:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:59,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:59,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:04,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:04,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137, 137] total 137 [2018-12-03 16:48:04,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:04,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 16:48:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 16:48:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4829, Invalid=14077, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:48:04,741 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 138 states. [2018-12-03 16:48:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:11,859 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-12-03 16:48:11,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-03 16:48:11,859 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 206 [2018-12-03 16:48:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:11,859 INFO L225 Difference]: With dead ends: 347 [2018-12-03 16:48:11,860 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 16:48:11,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 276 SyntacticMatches, 135 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15812 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=9657, Invalid=32573, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:48:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 16:48:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-12-03 16:48:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 16:48:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-12-03 16:48:11,955 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 206 [2018-12-03 16:48:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-12-03 16:48:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 16:48:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-12-03 16:48:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 16:48:11,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:11,956 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1, 1, 1] [2018-12-03 16:48:11,956 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:11,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1065061369, now seen corresponding path program 134 times [2018-12-03 16:48:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:11,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:11,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2346 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:13,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:13,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:13,926 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:13,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:48:13,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:13,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:48:13,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:48:13,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:48:14,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-12-03 16:48:14,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:14,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2346 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:14,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2278 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:18,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:18,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 76 [2018-12-03 16:48:18,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:18,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:48:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:48:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2645, Invalid=3207, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:48:18,163 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 75 states. [2018-12-03 16:48:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:20,313 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-12-03 16:48:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-12-03 16:48:20,313 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 207 [2018-12-03 16:48:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:20,314 INFO L225 Difference]: With dead ends: 216 [2018-12-03 16:48:20,314 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 16:48:20,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 341 SyntacticMatches, 135 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9871 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7609, Invalid=13271, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 16:48:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 16:48:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-12-03 16:48:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 16:48:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-12-03 16:48:20,413 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2018-12-03 16:48:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:20,413 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-12-03 16:48:20,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:48:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-12-03 16:48:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 16:48:20,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:20,414 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1] [2018-12-03 16:48:20,414 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:20,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1321692373, now seen corresponding path program 135 times [2018-12-03 16:48:20,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:20,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:20,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:20,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:25,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:25,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:25,848 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:25,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 16:48:25,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:25,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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:48:25,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:48:25,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:48:26,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:48:26,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:26,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:26,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:31,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:31,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 139 [2018-12-03 16:48:31,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:31,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 16:48:31,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 16:48:31,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14491, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:48:31,529 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 140 states. [2018-12-03 16:48:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:38,764 INFO L93 Difference]: Finished difference Result 352 states and 354 transitions. [2018-12-03 16:48:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-12-03 16:48:38,765 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 209 [2018-12-03 16:48:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:38,765 INFO L225 Difference]: With dead ends: 352 [2018-12-03 16:48:38,765 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 16:48:38,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 280 SyntacticMatches, 137 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16286 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=9937, Invalid=33535, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 16:48:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 16:48:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 16:48:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 16:48:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-03 16:48:38,863 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 209 [2018-12-03 16:48:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:38,863 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-03 16:48:38,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 16:48:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-03 16:48:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 16:48:38,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:38,864 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1, 1, 1] [2018-12-03 16:48:38,864 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:38,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2120197758, now seen corresponding path program 136 times [2018-12-03 16:48:38,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:38,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:38,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2415 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:40,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:40,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:40,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:48:40,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:40,877 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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:48:40,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:40,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:48:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:41,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2415 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:41,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2346 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:44,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:44,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 77 [2018-12-03 16:48:44,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:44,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:48:44,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:48:44,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2718, Invalid=3288, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:48:44,924 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 76 states. [2018-12-03 16:48:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:47,484 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-12-03 16:48:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-12-03 16:48:47,484 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 210 [2018-12-03 16:48:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:47,485 INFO L225 Difference]: With dead ends: 219 [2018-12-03 16:48:47,485 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 16:48:47,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 346 SyntacticMatches, 137 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10154 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7824, Invalid=13638, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 16:48:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 16:48:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2018-12-03 16:48:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:48:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-12-03 16:48:47,583 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-12-03 16:48:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:47,584 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-12-03 16:48:47,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:48:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-12-03 16:48:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 16:48:47,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:47,584 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1] [2018-12-03 16:48:47,584 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:47,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1695480346, now seen corresponding path program 137 times [2018-12-03 16:48:47,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:47,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:47,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:47,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:47,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:53,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:53,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:53,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:53,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:48:53,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:53,235 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:48:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:48:53,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:48:53,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 16:48:53,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:53,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:53,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:59,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:59,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141, 141] total 141 [2018-12-03 16:48:59,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:59,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 16:48:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 16:48:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5111, Invalid=14911, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:48:59,176 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 142 states. [2018-12-03 16:49:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:04,858 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-12-03 16:49:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-12-03 16:49:04,858 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 212 [2018-12-03 16:49:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:04,859 INFO L225 Difference]: With dead ends: 357 [2018-12-03 16:49:04,859 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 16:49:04,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 284 SyntacticMatches, 139 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16767 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=10221, Invalid=34511, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:49:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 16:49:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-12-03 16:49:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-03 16:49:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-12-03 16:49:04,959 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 212 [2018-12-03 16:49:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:04,960 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-12-03 16:49:04,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 16:49:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-12-03 16:49:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 16:49:04,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:04,960 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1, 1, 1] [2018-12-03 16:49:04,961 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 145552337, now seen corresponding path program 138 times [2018-12-03 16:49:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:04,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:04,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2485 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:07,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:07,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:07,103 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:07,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:07,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:07,104 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:49:07,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:07,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:07,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:07,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:07,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2485 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:07,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2415 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:11,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:11,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 78 [2018-12-03 16:49:11,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:11,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:49:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:49:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2792, Invalid=3370, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:49:11,096 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 77 states. [2018-12-03 16:49:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:13,660 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-12-03 16:49:13,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-12-03 16:49:13,661 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 213 [2018-12-03 16:49:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:13,661 INFO L225 Difference]: With dead ends: 222 [2018-12-03 16:49:13,661 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 16:49:13,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 351 SyntacticMatches, 139 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10441 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8042, Invalid=14010, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:49:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 16:49:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-12-03 16:49:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-03 16:49:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-12-03 16:49:13,765 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 213 [2018-12-03 16:49:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:13,765 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-12-03 16:49:13,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:49:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-12-03 16:49:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-03 16:49:13,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:13,766 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1] [2018-12-03 16:49:13,766 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:13,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1858191699, now seen corresponding path program 139 times [2018-12-03 16:49:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:13,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:13,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:13,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:13,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:19,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:19,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:19,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:19,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:19,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:19,547 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:49:19,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:19,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:19,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:19,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143, 143] total 143 [2018-12-03 16:49:25,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:25,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 16:49:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 16:49:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=15337, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:49:25,372 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 144 states. [2018-12-03 16:49:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:33,111 INFO L93 Difference]: Finished difference Result 362 states and 364 transitions. [2018-12-03 16:49:33,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-12-03 16:49:33,111 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 215 [2018-12-03 16:49:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:33,112 INFO L225 Difference]: With dead ends: 362 [2018-12-03 16:49:33,112 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 16:49:33,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 288 SyntacticMatches, 141 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17255 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=10509, Invalid=35501, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 16:49:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 16:49:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-12-03 16:49:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-03 16:49:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-12-03 16:49:33,217 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 215 [2018-12-03 16:49:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:33,217 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-12-03 16:49:33,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 16:49:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-12-03 16:49:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-03 16:49:33,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:33,218 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 1, 1, 1, 1] [2018-12-03 16:49:33,218 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:33,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash -570108522, now seen corresponding path program 140 times [2018-12-03 16:49:33,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:33,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:33,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:33,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:33,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 2556 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:35,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:35,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:35,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:35,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:35,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:35,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:49:35,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:35,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:35,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2018-12-03 16:49:35,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:35,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 2556 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:35,972 INFO L316 TraceCheckSpWp]: Computing backward predicates...